Recognised as Number
91,090
- Positive
- Even
- Composite
- 5 digits
91,090 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value91,090
Digit count5
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 5 × 9,109
Distinct prime factors32, 5, 9,109
Number of divisors8
Sum of divisors σ(n)163,980
Aliquot sum72,890sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)36,432integers below n that share no factor with it
Carmichael function λ(n)9,108the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 36,432
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 9,109, 18,218, 45,545, 91,0908 in total
Arithmetic
Representations
Decimal91,090
Binary1011000111101001017 bits
Octal261722
Hexadecimal163D2
Base 361YAA
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsninety-one thousand and ninety
Ordinalninety-one thousand and ninetieth
Scientific notation9.109 × 10^4
Engineering notation91.09 × 10^3
In other bases
Ternary11121221201base 3; the most digit-efficient integer base after e: 11 digits
Quinary10403330base 5; one hand: 8 digits
Septenary526366base 7: 6 digits
Nonary147851base 9; each digit is two ternary digits: 6 digits
Duodecimal4486abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalb7eabase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal25:18:10base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TTT0T00TT01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101010010011010110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010110001111010010
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 even
Highest set bitbit 16worth 65,536
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes301 63 d2
Gray code11101001000111011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010110001111010010
64-bit0000000000000000000000000000000000000000000000010110001111010010
One's complement11111111111111101001110000101101at 32 bits, every bit flipped
Bits reversed01001011110001101000000000000000at 32 bits
Rotated left by 100000000000000101100011110100100at 32 bits, wrapping
Shifted left by 1101100011110100100= 182,180, no wrap
Shifted right by 11011000111101001= 45,545, discarding the low bit
These bits as a double4.50044397 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
91,090 to the power 28,297,388,100
91,090 to the power 3755,809,082,029,000
91,090 to the power 468,846,649,282,021,610,000
91,090 to the power 56,271,241,283,099,348,454,900,000
First ten multiples91,090, 182,180, 273,270, 364,360, 455,450, 546,540, 637,630, 728,720, 819,810, 910,900
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8No, remainder 2
Divisible by 9No, remainder 1
Divisible by 10Yes
Divisible by 11No, remainder 10
Divisible by 12No, remainder 10
Divisible by 100No, remainder 90
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,090 → 45,545 → 136,636 → 68,318 → 34,159 → 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,000%
91,090% as a decimal910.9
91,090% of 10091,090
91,090% of 1,000910,900
As a fraction of 10091,090/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,090
Nerdulate something else
Nothing in mind? Surprise me · today’s page