Recognised as Number
-31,857
- Negative
- Odd
- 5 digits
-31,857 is an odd 5-digit integer and the negative of 31,857. It has 16 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value31,857
Digit count5
Digit sum24
Digit product840
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 7 × 37 × 41
Distinct prime factors43, 7, 37, 41
Number of divisors16
Sum of divisors σ(n)51,072
SquarefreeYesno repeated prime factor
All divisors1, 3, 7, 21, 37, 41, 111, 123, 259, 287, 777, 861, 1,517, 4,551, 10,619, 31,85716 in total
Arithmetic
Representations
Decimal-31,857
Binary11111000111000115 bits
Octal76161
Hexadecimal7C71
Base 36OKX
In wordsminus thirty-one thousand, eight hundred and fifty-seven
Ordinalminus thirty-one thousand, eight hundred and fifty-seventh
Scientific notation-3.1857 × 10^4
Engineering notation-31.857 × 10^3
In other bases
Ternary1121200220base 3; the most digit-efficient integer base after e: 10 digits
Quinary2004412base 5; one hand: 7 digits
Septenary161610base 7: 6 digits
Nonary47626base 9; each digit is two ternary digits: 5 digits
Duodecimal16529base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal3jchbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal8:50:57base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT110110T010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1000010010010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1000001110001111
Bit length15 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits6within that length
Bit parityodd9 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
Bytes27c 71
Gray code100001001001001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1000001110001111two's complement
32-bit11111111111111111000001110001111two's complement
64-bit1111111111111111111111111111111111111111111111111000001110001111two's complement
One's complement0111110001110000at 16 bits, every bit flipped
Bits reversed1111000111000001at 16 bits
Rotated left by 10000011100011111at 16 bits, wrapping
Shifted left by 1-1111100011100010= -63,714, no wrap
Shifted right by 1-11111000111001= -15,928, discarding the low bit
These bits as a double1.57394493 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-31,857 to the power 21,014,868,449
-31,857 to the power 3-32,330,664,179,793
-31,857 to the power 41,029,957,968,775,665,601
-31,857 to the power 5-32,811,371,011,286,379,051,057
First ten multiples-31,857, -63,714, -95,571, -127,428, -159,285, -191,142, -222,999, -254,856, -286,713, -318,570
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 1
Divisible by 9No, remainder 6
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 9
Divisible by 100No, remainder 57
As a percentage & fraction
As a percentage-3,185,700%
-31,857% as a decimal-318.57
-31,857% of 100-31,857
-31,857% of 1,000-318,570
As a fraction of 100-31,857/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -31,857
Nerdulate something else
Nothing in mind? Surprise me · today’s page