Recognised as Number
-31,437
- Negative
- Odd
- 5 digits
-31,437 is an odd 5-digit integer and the negative of 31,437. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value31,437
Digit count5
Digit sum18
Digit product252
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3^2 × 7 × 499
Distinct prime factors33, 7, 499
Number of divisors12
Sum of divisors σ(n)52,000
SquarefreeNohas a repeated prime factor
All divisors1, 3, 7, 9, 21, 63, 499, 1,497, 3,493, 4,491, 10,479, 31,43712 in total
Arithmetic
Representations
Decimal-31,437
Binary11110101100110115 bits
Octal75315
Hexadecimal7ACD
Base 36O99
In wordsminus thirty-one thousand, four hundred and thirty-seven
Ordinalminus thirty-one thousand, four hundred and thirty-seventh
Scientific notation-3.1437 × 10^4
Engineering notation-31.437 × 10^3
In other bases
Ternary1121010100base 3; the most digit-efficient integer base after e: 10 digits
Quinary2001222base 5; one hand: 7 digits
Septenary160440base 7: 6 digits
Nonary47110base 9; each digit is two ternary digits: 5 digits
Duodecimal16239base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal3ibhbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal8:43:57base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT111T0T0T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1000010101110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1000010100110011
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 cd
Gray code100011110101011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1000010100110011two's complement
32-bit11111111111111111000010100110011two's complement
64-bit1111111111111111111111111111111111111111111111111000010100110011two's complement
One's complement0111101011001100at 16 bits, every bit flipped
Bits reversed1100110010100001at 16 bits
Rotated left by 10000101001100111at 16 bits, wrapping
Shifted left by 1-1111010110011010= -62,874, no wrap
Shifted right by 1-11110101100111= -15,718, discarding the low bit
These bits as a double1.55319417 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-31,437 to the power 2988,284,969
-31,437 to the power 3-31,068,714,570,453
-31,437 to the power 4976,707,179,951,330,961
-31,437 to the power 5-30,704,743,616,129,991,420,957
First ten multiples-31,437, -62,874, -94,311, -125,748, -157,185, -188,622, -220,059, -251,496, -282,933, -314,370
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 5
Divisible by 9Yes
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 9
Divisible by 100No, remainder 37
As a percentage & fraction
As a percentage-3,143,700%
-31,437% as a decimal-314.37
-31,437% of 100-31,437
-31,437% of 1,000-314,370
As a fraction of 100-31,437/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -31,437
Nerdulate something else
Nothing in mind? Surprise me · today’s page