Recognised as Number
91,089
- Positive
- Odd
- Composite
- 5 digits
91,089 is an odd 5-digit integer and a composite number. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value91,089
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 × 29 × 349
Distinct prime factors33, 29, 349
Number of divisors12
Sum of divisors σ(n)136,500
Aliquot sum45,411sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)58,464integers below n that share no factor with it
Carmichael function λ(n)2,436the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 58,464
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 29, 87, 261, 349, 1,047, 3,141, 10,121, 30,363, 91,08912 in total
Arithmetic
Representations
Decimal91,089
Binary1011000111101000117 bits
Octal261721
Hexadecimal163D1
Base 361YA9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsninety-one thousand and eighty-nine
Ordinalninety-one thousand and eighty-ninth
Scientific notation9.1089 × 10^4
Engineering notation91.089 × 10^3
In other bases
Ternary11121221200base 3; the most digit-efficient integer base after e: 11 digits
Quinary10403324base 5; one hand: 8 digits
Septenary526365base 7: 6 digits
Nonary147850base 9; each digit is two ternary digits: 6 digits
Duodecimal44869base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalb7e9base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal25:18:9base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TTT0T00TT00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101010010011010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010110001111010001
Bit length17 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits8within that length
Bit parityodd9 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 63 d1
Gray code11101001000111001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010110001111010001
64-bit0000000000000000000000000000000000000000000000010110001111010001
One's complement11111111111111101001110000101110at 32 bits, every bit flipped
Bits reversed10001011110001101000000000000000at 32 bits
Rotated left by 100000000000000101100011110100010at 32 bits, wrapping
Shifted left by 1101100011110100010= 182,178, no wrap
Shifted right by 11011000111101000= 45,544, discarding the low bit
These bits as a double4.50039456 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
91,089 to the power 28,297,205,921
91,089 to the power 3755,784,190,137,969
91,089 to the power 468,843,626,095,477,458,241
91,089 to the power 56,270,897,057,410,946,193,714,449
First ten multiples91,089, 182,178, 273,267, 364,356, 455,445, 546,534, 637,623, 728,712, 819,801, 910,890
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 5
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 9
Divisible by 12No, remainder 9
Divisible by 100No, remainder 89
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 steps91,089 → 273,268 → 136,634 → 68,317 → 204,952 → 102,476 → 51,238 → 25,619 → 76,858 → 38,429 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage9,108,900%
91,089% as a decimal910.89
91,089% of 10091,089
91,089% of 1,000910,890
As a fraction of 10091,089/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 91,089
Nerdulate something else
Nothing in mind? Surprise me · today’s page