Recognised as Number
9,016,921
- Positive
- Odd
- Prime
- 7 digits
9,016,921 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 value9,016,921
Digit count7
Digit sum28
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 factorisation9,016,921
Distinct prime factors19,016,921
Number of divisors2
Sum of divisors σ(n)9,016,922
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,016,920integers below n that share no factor with it
Carmichael function λ(n)9,016,920the 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, 9,016,9212 in total
Arithmetic
Previous number9,016,920
Next number9,016,922
Double18,033,842
Half4,508,460.5
Square81,304,864,320,241
Cube733,119,538,491,331,797,961
Square root3,002.818842355≈irrational, shown to 9 decimal places
Cube root208.138660317≈
Negation-9,016,921
Reciprocal1.10902602 × 10^-7≈
Representations
Decimal9,016,921
Binary10001001100101100101100124 bits
Octal42313131
Hexadecimal899659
Base 365D9I1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, sixteen thousand, nine hundred and twenty-one
Ordinalnine million, sixteen thousand, nine hundred and twenty-first
Scientific notation9.016921 × 10^6
Engineering notation9.016921 × 10^6
In other bases
Ternary121222002220001base 3; the most digit-efficient integer base after e: 15 digits
Quinary4302020141base 5; one hand: 10 digits
Septenary136433254base 7: 9 digits
Nonary17862801base 9; each digit is two ternary digits: 8 digits
Duodecimal302a161base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2g7261base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal41:44:42:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T00T0100T0001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100111101110101110101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100010011001011001011001
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 96 59
Gray code110011010101110101110101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100010011001011001011001
64-bit0000000000000000000000000000000000000000100010011001011001011001
One's complement11111111011101100110100110100110at 32 bits, every bit flipped
Bits reversed10011010011010011001000100000000at 32 bits
Rotated left by 100000001000100110010110010110010at 32 bits, wrapping
Shifted left by 11000100110010110010110010= 18,033,842, no wrap
Shifted right by 110001001100101100101100= 4,508,460, discarding the low bit
These bits as a double4.4549509 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,016,921 to the power 281,304,864,320,241
9,016,921 to the power 3733,119,538,491,331,797,961
9,016,921 to the power 46,610,480,962,132,798,007,002,298,081
9,016,921 to the power 559,606,184,607,555,431,138,097,168,614,828,601
First ten multiples9,016,921, 18,033,842, 27,050,763, 36,067,684, 45,084,605, 54,101,526, 63,118,447, 72,135,368, 81,152,289, 90,169,210
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 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 21
Collatz (3n + 1) trajectory
Steps to reach 1163the total stopping time
Highest value reached30,432,1123× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,016,921 → 27,050,764 → 13,525,382 → 6,762,691 → 20,288,074 → 10,144,037 → 30,432,112 → 15,216,056 → 7,608,028 → 3,804,014 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage901,692,100%
9,016,921% as a decimal90,169.21
9,016,921% of 1009,016,921
9,016,921% of 1,00090,169,210
As a fraction of 1009,016,921/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 9,016,921
Nerdulate something else
Nothing in mind? Surprise me · today’s page