Recognised as Number
89,109
- Positive
- Odd
- Composite
- 5 digits
89,109 is an odd 5-digit integer and a composite number. It has 6 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value89,109
Digit count5
Digit sum27
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 9,901
Distinct prime factors23, 9,901
Number of divisors6
Sum of divisors σ(n)128,726
Aliquot sum39,617sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)59,400integers below n that share no factor with it
Carmichael function λ(n)9,900the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 59,400
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 9,901, 29,703, 89,1096 in total
Arithmetic
Representations
Decimal89,109
Binary1010111000001010117 bits
Octal256025
Hexadecimal15C15
Base 361WR9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-nine thousand, one hundred and nine
Ordinaleighty-nine thousand, one hundred and ninth
Scientific notation8.9109 × 10^4
Engineering notation89.109 × 10^3
In other bases
Ternary11112020100base 3; the most digit-efficient integer base after e: 11 digits
Quinary10322414base 5; one hand: 8 digits
Septenary520536base 7: 6 digits
Nonary145210base 9; each digit is two ternary digits: 6 digits
Duodecimal43699base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalb2f9base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal24:45:9base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TTTTT1T0100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101010110000010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010101110000010101
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 15
Gray code11111001000011111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010101110000010101
64-bit0000000000000000000000000000000000000000000000010101110000010101
One's complement11111111111111101010001111101010at 32 bits, every bit flipped
Bits reversed10101000001110101000000000000000at 32 bits
Rotated left by 100000000000000101011100000101010at 32 bits, wrapping
Shifted left by 1101011100000101010= 178,218, no wrap
Shifted right by 11010111000001010= 44,554, discarding the low bit
These bits as a double4.40256956 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
89,109 to the power 27,940,413,881
89,109 to the power 3707,562,340,522,029
89,109 to the power 463,050,172,601,577,482,161
89,109 to the power 55,618,337,830,353,967,857,884,549
First ten multiples89,109, 178,218, 267,327, 356,436, 445,545, 534,654, 623,763, 712,872, 801,981, 891,090
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 9
Divisible by 12No, remainder 9
Divisible by 100No, remainder 9
Collatz (3n + 1) trajectory
Steps to reach 1133the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps89,109 → 267,328 → 133,664 → 66,832 → 33,416 → 16,708 → 8,354 → 4,177 → 12,532 → 6,266 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage8,910,900%
89,109% as a decimal891.09
89,109% of 10089,109
89,109% of 1,000891,090
As a fraction of 10089,109/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 89,109
Nerdulate something else
Nothing in mind? Surprise me · today’s page