Recognised as Number
-22,801
- Negative
- Odd
- Perfect square
- 5 digits
-22,801 is an odd 5-digit integer and the negative of 22,801. It has 3 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value22,801
Digit count5
Digit sum13
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 151²
Factors & divisors
Prime factorisation−1 × 151^2
Distinct prime factors1151
Number of divisors3
Sum of divisors σ(n)22,953
SquarefreeNohas a repeated prime factor
All divisors1, 151, 22,8013 in total
Arithmetic
Representations
Decimal-22,801
Binary10110010001000115 bits
Octal54421
Hexadecimal5911
Base 36HLD
In wordsminus twenty-two thousand, eight hundred and one
Ordinalminus twenty-two thousand, eight hundred and first
Scientific notation-2.2801 × 10^4
Engineering notation-22.801 × 10^3
In other bases
Ternary1011021111base 3; the most digit-efficient integer base after e: 10 digits
Quinary1212201base 5; one hand: 7 digits
Septenary123322base 7: 6 digits
Nonary34244base 9; each digit is two ternary digits: 5 digits
Duodecimal11241base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal2h01base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal6:20:1base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0TTT1TTTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111101100110011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1010011011101111
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
Bytes259 11
Gray code111010110011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1010011011101111two's complement
32-bit11111111111111111010011011101111two's complement
64-bit1111111111111111111111111111111111111111111111111010011011101111two's complement
One's complement0101100100010000at 16 bits, every bit flipped
Bits reversed1111011101100101at 16 bits
Rotated left by 10100110111011111at 16 bits, wrapping
Shifted left by 1-1011001000100010= -45,602, no wrap
Shifted right by 1-10110010001001= -11,400, discarding the low bit
These bits as a double1.12651908 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-22,801 to the power 2519,885,601
-22,801 to the power 3-11,853,911,588,401
-22,801 to the power 4270,281,038,127,131,201
-22,801 to the power 5-6,162,677,950,336,718,514,001
First ten multiples-22,801, -45,602, -68,403, -91,204, -114,005, -136,806, -159,607, -182,408, -205,209, -228,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 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1
As a percentage & fraction
As a percentage-2,280,100%
-22,801% as a decimal-228.01
-22,801% of 100-22,801
-22,801% of 1,000-228,010
As a fraction of 100-22,801/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -22,801
Nerdulate something else
Nothing in mind? Surprise me · today’s page