Recognised as Number
8,991,901
- Positive
- Odd
- Prime
- 7 digits
8,991,901 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value8,991,901
Digit count7
Digit sum37
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 factorisation8,991,901
Distinct prime factors18,991,901
Number of divisors2
Sum of divisors σ(n)8,991,902
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)8,991,900integers below n that share no factor with it
Carmichael function λ(n)8,991,900the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 8,991,9012 in total
Arithmetic
Previous number8,991,900
Next number8,991,902
Double17,983,802
Half4,495,950.5
Square80,854,283,593,801
Cube727,033,713,501,382,805,701
Square root2,998.649862855≈irrational, shown to 9 decimal places
Cube root207.945968769≈
Negation-8,991,901
Reciprocal1.11211189 × 10^-7≈
Representations
Decimal8,991,901
Binary10001001001101001001110124 bits
Octal42232235
Hexadecimal89349D
Base 365CQ71
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseight million, nine hundred and ninety-one thousand, nine hundred and one
Ordinaleight million, nine hundred and ninety-one thousand, nine hundred and first
Scientific notation8.991901 × 10^6
Engineering notation8.991901 × 10^6
In other bases
Ternary121220211120101base 3; the most digit-efficient integer base after e: 15 digits
Quinary4300220101base 5; one hand: 10 digits
Septenary136300312base 7: 9 digits
Nonary17824511base 9; each digit is two ternary digits: 8 digits
Duodecimal3017791base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2g3jf1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal41:37:45:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T0T10TTTT0101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100110010111010111101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100010010011010010011101
Bit length24 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits13within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes389 34 9d
Gray code110011011010111011010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100010010011010010011101
64-bit0000000000000000000000000000000000000000100010010011010010011101
One's complement11111111011101101100101101100010at 32 bits, every bit flipped
Bits reversed10111001001011001001000100000000at 32 bits
Rotated left by 100000001000100100110100100111010at 32 bits, wrapping
Shifted left by 11000100100110100100111010= 17,983,802, no wrap
Shifted right by 110001001001101001001110= 4,495,950, discarding the low bit
These bits as a double4.44258937 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
8,991,901 to the power 280,854,283,593,801
8,991,901 to the power 3727,033,713,501,382,805,701
8,991,901 to the power 46,537,415,175,466,797,551,965,627,601
8,991,901 to the power 558,783,790,053,695,072,374,317,278,791,059,501
First ten multiples8,991,901, 17,983,802, 26,975,703, 35,967,604, 44,959,505, 53,951,406, 62,943,307, 71,935,208, 80,927,109, 89,919,010
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1163the total stopping time
Highest value reached36,955,9244× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps8,991,901 → 26,975,704 → 13,487,852 → 6,743,926 → 3,371,963 → 10,115,890 → 5,057,945 → 15,173,836 → 7,586,918 → 3,793,459 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage899,190,100%
8,991,901% as a decimal89,919.01
8,991,901% of 1008,991,901
8,991,901% of 1,00089,919,010
As a fraction of 1008,991,901/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 8,991,901
Nerdulate something else
Nothing in mind? Surprise me · today’s page