Recognised as Number
-89,107
- Negative
- Odd
- 5 digits
-89,107 is an odd 5-digit integer and the negative of 89,107. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value89,107
Digit count5
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 89,107
Distinct prime factors189,107
Number of divisors2
Sum of divisors σ(n)89,108
SquarefreeYesno repeated prime factor
All divisors1, 89,1072 in total
Arithmetic
Representations
Decimal-89,107
Binary1010111000001001117 bits
Octal256023
Hexadecimal15C13
Base 361WR7
In wordsminus eighty-nine thousand, one hundred and seven
Ordinalminus eighty-nine thousand, one hundred and seventh
Scientific notation-8.9107 × 10^4
Engineering notation-89.107 × 10^3
In other bases
Ternary11112020021base 3; the most digit-efficient integer base after e: 11 digits
Quinary10322412base 5; one hand: 8 digits
Septenary520534base 7: 6 digits
Nonary145207base 9; each digit is two ternary digits: 6 digits
Duodecimal43697base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalb2f7base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal24:45:7base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT11111T10T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111110010000111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111101010001111101101
Bit length17 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits9within that length
Bit parityeven8 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 5c 13
Gray code11111001000011010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111101010001111101101two's complement
64-bit1111111111111111111111111111111111111111111111101010001111101101two's complement
One's complement00000000000000010101110000010010at 32 bits, every bit flipped
Bits reversed10110111110001010111111111111111at 32 bits
Rotated left by 111111111111111010100011111011011at 32 bits, wrapping
Shifted left by 1-101011100000100110= -178,214, no wrap
Shifted right by 1-1010111000001010= -44,553, discarding the low bit
These bits as a double4.40247075 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-89,107 to the power 27,940,057,449
-89,107 to the power 3-707,514,699,108,043
-89,107 to the power 463,044,512,293,420,387,601
-89,107 to the power 5-5,617,707,356,929,810,477,962,307
First ten multiples-89,107, -178,214, -267,321, -356,428, -445,535, -534,642, -623,749, -712,856, -801,963, -891,070
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 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 7
Divisible by 12No, remainder 7
Divisible by 100No, remainder 7
As a percentage & fraction
As a percentage-8,910,700%
-89,107% as a decimal-891.07
-89,107% of 100-89,107
-89,107% of 1,000-891,070
As a fraction of 100-89,107/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -89,107
Nerdulate something else
Nothing in mind? Surprise me · today’s page