Recognised as Number
-89,021
- Negative
- Odd
- 5 digits
-89,021 is an odd 5-digit integer and the negative of 89,021. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value89,021
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 × 89,021
Distinct prime factors189,021
Number of divisors2
Sum of divisors σ(n)89,022
SquarefreeYesno repeated prime factor
All divisors1, 89,0212 in total
Arithmetic
Representations
Decimal-89,021
Binary1010110111011110117 bits
Octal255675
Hexadecimal15BBD
Base 361WOT
In wordsminus eighty-nine thousand and twenty-one
Ordinalminus eighty-nine thousand and twenty-first
Scientific notation-8.9021 × 10^4
Engineering notation-89.021 × 10^3
In other bases
Ternary11112010002base 3; the most digit-efficient integer base after e: 11 digits
Quinary10322041base 5; one hand: 8 digits
Septenary520352base 7: 6 digits
Nonary145102base 9; each digit is two ternary digits: 6 digits
Duodecimal43625base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalb2b1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal24:43:41base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT111110T00T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111110010001000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111101010010001000011
Bit length17 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits5within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 16worth 65,536
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes301 5b bd
Gray code11111011001100011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111101010010001000011two's complement
64-bit1111111111111111111111111111111111111111111111101010010001000011two's complement
One's complement00000000000000010101101110111100at 32 bits, every bit flipped
Bits reversed11000010001001010111111111111111at 32 bits
Rotated left by 111111111111111010100100010000111at 32 bits, wrapping
Shifted left by 1-101011011101111010= -178,042, no wrap
Shifted right by 1-1010110111011111= -44,510, discarding the low bit
These bits as a double4.39822179 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-89,021 to the power 27,924,738,441
-89,021 to the power 3-705,468,140,756,261
-89,021 to the power 462,801,479,358,263,110,481
-89,021 to the power 5-5,590,650,493,951,940,358,129,101
First ten multiples-89,021, -178,042, -267,063, -356,084, -445,105, -534,126, -623,147, -712,168, -801,189, -890,210
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 21
As a percentage & fraction
As a percentage-8,902,100%
-89,021% as a decimal-890.21
-89,021% of 100-89,021
-89,021% of 1,000-890,210
As a fraction of 100-89,021/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -89,021
Nerdulate something else
Nothing in mind? Surprise me · today’s page