Recognised as Number
-89,023
- Negative
- Odd
- 5 digits
-89,023 is an odd 5-digit integer and the negative of 89,023. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value89,023
Digit count5
Digit sum22
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
Factors & divisors
Prime factorisation−1 × 11 × 8,093
Distinct prime factors211, 8,093
Number of divisors4
Sum of divisors σ(n)97,128
SquarefreeYesno repeated prime factor
All divisors1, 11, 8,093, 89,0234 in total
Arithmetic
Representations
Decimal-89,023
Binary1010110111011111117 bits
Octal255677
Hexadecimal15BBF
Base 361WOV
In wordsminus eighty-nine thousand and twenty-three
Ordinalminus eighty-nine thousand and twenty-third
Scientific notation-8.9023 × 10^4
Engineering notation-89.023 × 10^3
In other bases
Ternary11112010011base 3; the most digit-efficient integer base after e: 11 digits
Quinary10322043base 5; one hand: 8 digits
Septenary520354base 7: 6 digits
Nonary145104base 9; each digit is two ternary digits: 6 digits
Duodecimal43627base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalb2b3base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal24:43:43base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT111110T00TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111110010001000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111101010010001000001
Bit length17 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits4within that length
Bit parityodd13 set bits, so odd; 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 bf
Gray code11111011001100000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111101010010001000001two's complement
64-bit1111111111111111111111111111111111111111111111101010010001000001two's complement
One's complement00000000000000010101101110111110at 32 bits, every bit flipped
Bits reversed10000010001001010111111111111111at 32 bits
Rotated left by 111111111111111010100100010000011at 32 bits, wrapping
Shifted left by 1-101011011101111110= -178,046, no wrap
Shifted right by 1-1010110111100000= -44,511, discarding the low bit
These bits as a double4.3983206 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-89,023 to the power 27,925,094,529
-89,023 to the power 3-705,515,690,255,167
-89,023 to the power 462,807,123,293,585,731,841
-89,023 to the power 5-5,591,278,536,964,882,605,681,343
First ten multiples-89,023, -178,046, -267,069, -356,092, -445,115, -534,138, -623,161, -712,184, -801,207, -890,230
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11Yes
Divisible by 12No, remainder 7
Divisible by 100No, remainder 23
As a percentage & fraction
As a percentage-8,902,300%
-89,023% as a decimal-890.23
-89,023% of 100-89,023
-89,023% of 1,000-890,230
As a fraction of 100-89,023/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -89,023
Nerdulate something else
Nothing in mind? Surprise me · today’s page