Recognised as Number
-31,501
- Negative
- Odd
- 5 digits
-31,501 is an odd 5-digit integer and the negative of 31,501. It has 6 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value31,501
Digit count5
Digit sum10
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 17^2 × 109
Distinct prime factors217, 109
Number of divisors6
Sum of divisors σ(n)33,770
SquarefreeNohas a repeated prime factor
All divisors1, 17, 109, 289, 1,853, 31,5016 in total
Arithmetic
Representations
Decimal-31,501
Binary11110110000110115 bits
Octal75415
Hexadecimal7B0D
Base 36OB1
In wordsminus thirty-one thousand, five hundred and one
Ordinalminus thirty-one thousand, five hundred and first
Scientific notation-3.1501 × 10^4
Engineering notation-31.501 × 10^3
In other bases
Ternary1121012201base 3; the most digit-efficient integer base after e: 10 digits
Quinary2002001base 5; one hand: 7 digits
Septenary160561base 7: 6 digits
Nonary47181base 9; each digit is two ternary digits: 5 digits
Duodecimal16291base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal3if1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal8:45:1base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT111TT1010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1000010100110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1000010011110011
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
Bytes27b 0d
Gray code100011010001011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1000010011110011two's complement
32-bit11111111111111111000010011110011two's complement
64-bit1111111111111111111111111111111111111111111111111000010011110011two's complement
One's complement0111101100001100at 16 bits, every bit flipped
Bits reversed1100111100100001at 16 bits
Rotated left by 10000100111100111at 16 bits, wrapping
Shifted left by 1-1111011000011010= -63,002, no wrap
Shifted right by 1-11110110000111= -15,750, discarding the low bit
These bits as a double1.55635619 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-31,501 to the power 2992,313,001
-31,501 to the power 3-31,258,851,844,501
-31,501 to the power 4984,685,091,953,626,001
-31,501 to the power 5-31,018,565,081,631,172,657,501
First ten multiples-31,501, -63,002, -94,503, -126,004, -157,505, -189,006, -220,507, -252,008, -283,509, -315,010
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 8
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1
As a percentage & fraction
As a percentage-3,150,100%
-31,501% as a decimal-315.01
-31,501% of 100-31,501
-31,501% of 1,000-315,010
As a fraction of 100-31,501/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -31,501
Nerdulate something else
Nothing in mind? Surprise me · today’s page