Recognised as Number
-31,407
- Negative
- Odd
- 5 digits
-31,407 is an odd 5-digit integer and the negative of 31,407. It has 12 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value31,407
Digit count5
Digit sum15
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 19^2 × 29
Distinct prime factors33, 19, 29
Number of divisors12
Sum of divisors σ(n)45,720
SquarefreeNohas a repeated prime factor
All divisors1, 3, 19, 29, 57, 87, 361, 551, 1,083, 1,653, 10,469, 31,40712 in total
Arithmetic
Representations
Decimal-31,407
Binary11110101010111115 bits
Octal75257
Hexadecimal7AAF
Base 36O8F
In wordsminus thirty-one thousand, four hundred and seven
Ordinalminus thirty-one thousand, four hundred and seventh
Scientific notation-3.1407 × 10^4
Engineering notation-31.407 × 10^3
In other bases
Ternary1121002020base 3; the most digit-efficient integer base after e: 10 digits
Quinary2001112base 5; one hand: 7 digits
Septenary160365base 7: 6 digits
Nonary47066base 9; each digit is two ternary digits: 5 digits
Duodecimal16213base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal3ia7base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal8:43:27base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT111T0T1T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1000010101010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1000010101010001
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 af
Gray code100011111111000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1000010101010001two's complement
32-bit11111111111111111000010101010001two's complement
64-bit1111111111111111111111111111111111111111111111111000010101010001two's complement
One's complement0111101010101110at 16 bits, every bit flipped
Bits reversed1000101010100001at 16 bits
Rotated left by 10000101010100011at 16 bits, wrapping
Shifted left by 1-1111010101011110= -62,814, no wrap
Shifted right by 1-11110101011000= -15,703, discarding the low bit
These bits as a double1.55171197 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-31,407 to the power 2986,399,649
-31,407 to the power 3-30,979,853,776,143
-31,407 to the power 4972,984,267,547,323,201
-31,407 to the power 5-30,558,516,890,858,779,773,807
First ten multiples-31,407, -62,814, -94,221, -125,628, -157,035, -188,442, -219,849, -251,256, -282,663, -314,070
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 6
Divisible by 10No, remainder 7
Divisible by 11No, remainder 2
Divisible by 12No, remainder 3
Divisible by 100No, remainder 7
As a percentage & fraction
As a percentage-3,140,700%
-31,407% as a decimal-314.07
-31,407% of 100-31,407
-31,407% of 1,000-314,070
As a fraction of 100-31,407/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -31,407
Nerdulate something else
Nothing in mind? Surprise me · today’s page