Recognised as Number
-30,971
- Negative
- Odd
- 5 digits
-30,971 is an odd 5-digit integer and the negative of 30,971. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value30,971
Digit count5
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 30,971
Distinct prime factors130,971
Number of divisors2
Sum of divisors σ(n)30,972
SquarefreeYesno repeated prime factor
All divisors1, 30,9712 in total
Arithmetic
Representations
Decimal-30,971
Binary11110001111101115 bits
Octal74373
Hexadecimal78FB
Base 36NWB
In wordsminus thirty thousand, nine hundred and seventy-one
Ordinalminus thirty thousand, nine hundred and seventy-first
Scientific notation-3.0971 × 10^4
Engineering notation-30.971 × 10^3
In other bases
Ternary1120111002base 3; the most digit-efficient integer base after e: 10 digits
Quinary1442341base 5; one hand: 7 digits
Septenary156203base 7: 6 digits
Nonary46432base 9; each digit is two ternary digits: 5 digits
Duodecimal15b0bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal3h8bbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal8:36:11base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1110TTT0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1001101100000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1000011100000101
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
Bytes278 fb
Gray code100010010000110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1000011100000101two's complement
32-bit11111111111111111000011100000101two's complement
64-bit1111111111111111111111111111111111111111111111111000011100000101two's complement
One's complement0111100011111010at 16 bits, every bit flipped
Bits reversed1010000011100001at 16 bits
Rotated left by 10000111000001011at 16 bits, wrapping
Shifted left by 1-1111000111110110= -61,942, no wrap
Shifted right by 1-11110001111110= -15,485, discarding the low bit
These bits as a double1.53017071 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-30,971 to the power 2959,202,841
-30,971 to the power 3-29,707,471,188,611
-30,971 to the power 4920,070,090,182,471,281
-30,971 to the power 5-28,495,490,763,041,318,043,851
First ten multiples-30,971, -61,942, -92,913, -123,884, -154,855, -185,826, -216,797, -247,768, -278,739, -309,710
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 11
Divisible by 100No, remainder 71
As a percentage & fraction
As a percentage-3,097,100%
-30,971% as a decimal-309.71
-30,971% of 100-30,971
-30,971% of 1,000-309,710
As a fraction of 100-30,971/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -30,971
Nerdulate something else
Nothing in mind? Surprise me · today’s page