Recognised as Number
-31,411
- Negative
- Odd
- 5 digits
-31,411 is an odd 5-digit integer and the negative of 31,411. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value31,411
Digit count5
Digit sum10
Digit product12
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 101 × 311
Distinct prime factors2101, 311
Number of divisors4
Sum of divisors σ(n)31,824
SquarefreeYesno repeated prime factor
All divisors1, 101, 311, 31,4114 in total
Arithmetic
Representations
Decimal-31,411
Binary11110101011001115 bits
Octal75263
Hexadecimal7AB3
Base 36O8J
In wordsminus thirty-one thousand, four hundred and eleven
Ordinalminus thirty-one thousand, four hundred and eleventh
Scientific notation-3.1411 × 10^4
Engineering notation-31.411 × 10^3
In other bases
Ternary1121002101base 3; the most digit-efficient integer base after e: 10 digits
Quinary2001121base 5; one hand: 7 digits
Septenary160402base 7: 6 digits
Nonary47071base 9; each digit is two ternary digits: 5 digits
Duodecimal16217base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal3iabbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal8:43:31base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT111T0T1T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1000010101011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1000010101001101
Bit length15 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits5within that length
Bit parityeven10 set bits, so even; 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 b3
Gray code100011111101010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1000010101001101two's complement
32-bit11111111111111111000010101001101two's complement
64-bit1111111111111111111111111111111111111111111111111000010101001101two's complement
One's complement0111101010110010at 16 bits, every bit flipped
Bits reversed1011001010100001at 16 bits
Rotated left by 10000101010011011at 16 bits, wrapping
Shifted left by 1-1111010101100110= -62,822, no wrap
Shifted right by 1-11110101011010= -15,705, discarding the low bit
These bits as a double1.5519096 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-31,411 to the power 2986,650,921
-31,411 to the power 3-30,991,692,079,531
-31,411 to the power 4973,480,039,910,148,241
-31,411 to the power 5-30,577,981,533,617,666,398,051
First ten multiples-31,411, -62,822, -94,233, -125,644, -157,055, -188,466, -219,877, -251,288, -282,699, -314,110
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 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 7
Divisible by 100No, remainder 11
As a percentage & fraction
As a percentage-3,141,100%
-31,411% as a decimal-314.11
-31,411% of 100-31,411
-31,411% of 1,000-314,110
As a fraction of 100-31,411/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -31,411
Nerdulate something else
Nothing in mind? Surprise me · today’s page