Recognised as Number
91,091
- Positive
- Odd
- Composite
- 5 digits
91,091 is an odd 5-digit integer and a composite number. It has 18 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value91,091
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
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7^2 × 11 × 13^2
Distinct prime factors37, 11, 13
Number of divisors18
Sum of divisors σ(n)125,172
Aliquot sum34,081sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)65,520integers below n that share no factor with it
Carmichael function λ(n)5,460the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 65,520
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 7, 11, 13, 49, 77, 91, 143, 169, 539, 637, 1,001, 1,183, 1,859, 7,007, 8,281, 13,013, 91,09118 in total
Arithmetic
Representations
Decimal91,091
Binary1011000111101001117 bits
Octal261723
Hexadecimal163D3
Base 361YAB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsninety-one thousand and ninety-one
Ordinalninety-one thousand and ninety-first
Scientific notation9.1091 × 10^4
Engineering notation91.091 × 10^3
In other bases
Ternary11121221202base 3; the most digit-efficient integer base after e: 11 digits
Quinary10403331base 5; one hand: 8 digits
Septenary526400base 7: 6 digits
Nonary147852base 9; each digit is two ternary digits: 6 digits
Duodecimal4486bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalb7ebbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal25:18:11base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TTT0T00TT1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101010010011010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010110001111010011
Bit length17 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits7within that length
Bit parityeven10 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 63 d3
Gray code11101001000111010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010110001111010011
64-bit0000000000000000000000000000000000000000000000010110001111010011
One's complement11111111111111101001110000101100at 32 bits, every bit flipped
Bits reversed11001011110001101000000000000000at 32 bits
Rotated left by 100000000000000101100011110100110at 32 bits, wrapping
Shifted left by 1101100011110100110= 182,182, no wrap
Shifted right by 11011000111101001= 45,545, discarding the low bit
These bits as a double4.50049337 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
91,091 to the power 28,297,570,281
91,091 to the power 3755,833,974,466,571
91,091 to the power 468,849,672,568,134,418,961
91,091 to the power 56,271,585,523,903,932,357,576,451
First ten multiples91,091, 182,182, 273,273, 364,364, 455,455, 546,546, 637,637, 728,728, 819,819, 910,910
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 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11Yes
Divisible by 12No, remainder 11
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 1208the total stopping time
Highest value reached4,733,15251× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps91,091 → 273,274 → 136,637 → 409,912 → 204,956 → 102,478 → 51,239 → 153,718 → 76,859 → 230,578 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage9,109,100%
91,091% as a decimal910.91
91,091% of 10091,091
91,091% of 1,000910,910
As a fraction of 10091,091/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,091
Nerdulate something else
Nothing in mind? Surprise me · today’s page