Recognised as Number
-20,809
- Negative
- Odd
- 5 digits
-20,809 is an odd 5-digit integer and the negative of 20,809. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value20,809
Digit count5
Digit sum19
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 × 20,809
Distinct prime factors120,809
Number of divisors2
Sum of divisors σ(n)20,810
SquarefreeYesno repeated prime factor
All divisors1, 20,8092 in total
Arithmetic
Representations
Decimal-20,809
Binary10100010100100115 bits
Octal50511
Hexadecimal5149
Base 36G21
In wordsminus twenty thousand, eight hundred and nine
Ordinalminus twenty thousand, eight hundred and ninth
Scientific notation-2.0809 × 10^4
Engineering notation-20.809 × 10^3
In other bases
Ternary1001112201base 3; the most digit-efficient integer base after e: 10 digits
Quinary1131214base 5; one hand: 7 digits
Septenary114445base 7: 6 digits
Nonary31481base 9; each digit is two ternary digits: 5 digits
Duodecimal10061base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal2c09base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal5:46:49base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0T111010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111001111001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1010111010110111
Bit length15 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits9within that length
Bit parityeven6 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
Bytes251 49
Gray code111100111101101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1010111010110111two's complement
32-bit11111111111111111010111010110111two's complement
64-bit1111111111111111111111111111111111111111111111111010111010110111two's complement
One's complement0101000101001000at 16 bits, every bit flipped
Bits reversed1110110101110101at 16 bits
Rotated left by 10101110101101111at 16 bits, wrapping
Shifted left by 1-1010001010010010= -41,618, no wrap
Shifted right by 1-10100010100101= -10,404, discarding the low bit
These bits as a double1.0281012 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-20,809 to the power 2433,014,481
-20,809 to the power 3-9,010,598,335,129
-20,809 to the power 4187,501,540,755,699,361
-20,809 to the power 5-3,901,719,561,585,348,003,049
First ten multiples-20,809, -41,618, -62,427, -83,236, -104,045, -124,854, -145,663, -166,472, -187,281, -208,090
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 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 8
Divisible by 12No, remainder 1
Divisible by 100No, remainder 9
As a percentage & fraction
As a percentage-2,080,900%
-20,809% as a decimal-208.09
-20,809% of 100-20,809
-20,809% of 1,000-208,090
As a fraction of 100-20,809/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -20,809
Nerdulate something else
Nothing in mind? Surprise me · today’s page