Recognised as Number
-20,811
- Negative
- Odd
- 5 digits
-20,811 is an odd 5-digit integer and the negative of 20,811. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value20,811
Digit count5
Digit sum12
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 7 × 991
Distinct prime factors33, 7, 991
Number of divisors8
Sum of divisors σ(n)31,744
SquarefreeYesno repeated prime factor
All divisors1, 3, 7, 21, 991, 2,973, 6,937, 20,8118 in total
Arithmetic
Representations
Decimal-20,811
Binary10100010100101115 bits
Octal50513
Hexadecimal514B
Base 36G23
In wordsminus twenty thousand, eight hundred and eleven
Ordinalminus twenty thousand, eight hundred and eleventh
Scientific notation-2.0811 × 10^4
Engineering notation-20.811 × 10^3
In other bases
Ternary1001112210base 3; the most digit-efficient integer base after e: 10 digits
Quinary1131221base 5; one hand: 7 digits
Septenary114450base 7: 6 digits
Nonary31483base 9; each digit is two ternary digits: 5 digits
Duodecimal10063base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal2c0bbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal5:46:51base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0T11101T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111001111110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1010111010110101
Bit length15 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits8within that length
Bit parityodd7 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
Bytes251 4b
Gray code111100111101110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1010111010110101two's complement
32-bit11111111111111111010111010110101two's complement
64-bit1111111111111111111111111111111111111111111111111010111010110101two's complement
One's complement0101000101001010at 16 bits, every bit flipped
Bits reversed1010110101110101at 16 bits
Rotated left by 10101110101101011at 16 bits, wrapping
Shifted left by 1-1010001010010110= -41,622, no wrap
Shifted right by 1-10100010100110= -10,405, discarding the low bit
These bits as a double1.02820002 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-20,811 to the power 2433,097,721
-20,811 to the power 3-9,013,196,671,731
-20,811 to the power 4187,573,635,935,393,841
-20,811 to the power 5-3,903,594,937,451,481,225,051
First ten multiples-20,811, -41,622, -62,433, -83,244, -104,055, -124,866, -145,677, -166,488, -187,299, -208,110
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 1
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 3
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 3
Divisible by 100No, remainder 11
As a percentage & fraction
As a percentage-2,081,100%
-20,811% as a decimal-208.11
-20,811% of 100-20,811
-20,811% of 1,000-208,110
As a fraction of 100-20,811/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -20,811
Nerdulate something else
Nothing in mind? Surprise me · today’s page