Recognised as Number
-31,439
- Negative
- Odd
- 5 digits
-31,439 is an odd 5-digit integer and the negative of 31,439. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value31,439
Digit count5
Digit sum20
Digit product324
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 149 × 211
Distinct prime factors2149, 211
Number of divisors4
Sum of divisors σ(n)31,800
SquarefreeYesno repeated prime factor
All divisors1, 149, 211, 31,4394 in total
Arithmetic
Representations
Decimal-31,439
Binary11110101100111115 bits
Octal75317
Hexadecimal7ACF
Base 36O9B
In wordsminus thirty-one thousand, four hundred and thirty-nine
Ordinalminus thirty-one thousand, four hundred and thirty-ninth
Scientific notation-3.1439 × 10^4
Engineering notation-31.439 × 10^3
In other bases
Ternary1121010102base 3; the most digit-efficient integer base after e: 10 digits
Quinary2001224base 5; one hand: 7 digits
Septenary160442base 7: 6 digits
Nonary47112base 9; each digit is two ternary digits: 5 digits
Duodecimal1623bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal3ibjbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal8:43:59base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT111T0T0TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1000010101110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1000010100110001
Bit length15 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits4within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 14worth 16,384
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes27a cf
Gray code100011110101000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1000010100110001two's complement
32-bit11111111111111111000010100110001two's complement
64-bit1111111111111111111111111111111111111111111111111000010100110001two's complement
One's complement0111101011001110at 16 bits, every bit flipped
Bits reversed1000110010100001at 16 bits
Rotated left by 10000101001100011at 16 bits, wrapping
Shifted left by 1-1111010110011110= -62,878, no wrap
Shifted right by 1-11110101101000= -15,719, discarding the low bit
These bits as a double1.55329298 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-31,439 to the power 2988,410,721
-31,439 to the power 3-31,074,644,657,519
-31,439 to the power 4976,955,753,387,739,841
-31,439 to the power 5-30,714,511,930,757,152,861,199
First ten multiples-31,439, -62,878, -94,317, -125,756, -157,195, -188,634, -220,073, -251,512, -282,951, -314,390
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 11
Divisible by 100No, remainder 39
As a percentage & fraction
As a percentage-3,143,900%
-31,439% as a decimal-314.39
-31,439% of 100-31,439
-31,439% of 1,000-314,390
As a fraction of 100-31,439/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -31,439
Nerdulate something else
Nothing in mind? Surprise me · today’s page