Recognised as Number
-31,855
- Negative
- Odd
- 5 digits
-31,855 is an odd 5-digit integer and the negative of 31,855. It has 8 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value31,855
Digit count5
Digit sum22
Digit product600
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 5 × 23 × 277
Distinct prime factors35, 23, 277
Number of divisors8
Sum of divisors σ(n)40,032
SquarefreeYesno repeated prime factor
All divisors1, 5, 23, 115, 277, 1,385, 6,371, 31,8558 in total
Arithmetic
Representations
Decimal-31,855
Binary11111000110111115 bits
Octal76157
Hexadecimal7C6F
Base 36OKV
In wordsminus thirty-one thousand, eight hundred and fifty-five
Ordinalminus thirty-one thousand, eight hundred and fifty-fifth
Scientific notation-3.1855 × 10^4
Engineering notation-31.855 × 10^3
In other bases
Ternary1121200211base 3; the most digit-efficient integer base after e: 10 digits
Quinary2004410base 5; one hand: 7 digits
Septenary161605base 7: 6 digits
Nonary47624base 9; each digit is two ternary digits: 5 digits
Duodecimal16527base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal3jcfbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal8:50:55base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT110110T1TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1000010010010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1000001110010001
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
Bytes27c 6f
Gray code100001001011000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1000001110010001two's complement
32-bit11111111111111111000001110010001two's complement
64-bit1111111111111111111111111111111111111111111111111000001110010001two's complement
One's complement0111110001101110at 16 bits, every bit flipped
Bits reversed1000100111000001at 16 bits
Rotated left by 10000011100100011at 16 bits, wrapping
Shifted left by 1-1111100011011110= -63,710, no wrap
Shifted right by 1-11111000111000= -15,927, discarding the low bit
These bits as a double1.57384611 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-31,855 to the power 21,014,741,025
-31,855 to the power 3-32,324,575,351,375
-31,855 to the power 41,029,699,347,818,050,625
-31,855 to the power 5-32,801,072,724,744,002,659,375
First ten multiples-31,855, -63,710, -95,565, -127,420, -159,275, -191,130, -222,985, -254,840, -286,695, -318,550
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 5
Divisible by 11No, remainder 10
Divisible by 12No, remainder 7
Divisible by 100No, remainder 55
As a percentage & fraction
As a percentage-3,185,500%
-31,855% as a decimal-318.55
-31,855% of 100-31,855
-31,855% of 1,000-318,550
As a fraction of 100-31,855/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -31,855
Nerdulate something else
Nothing in mind? Surprise me · today’s page