Recognised as Number
9,011,857
- Positive
- Odd
- Prime
- 7 digits
9,011,857 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value9,011,857
Digit count7
Digit sum31
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation9,011,857
Distinct prime factors19,011,857
Number of divisors2
Sum of divisors σ(n)9,011,858
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,011,856integers below n that share no factor with it
Carmichael function λ(n)9,011,856the 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,011,8572 in total
Arithmetic
Previous number9,011,856
Next number9,011,858
Double18,023,714
Half4,505,928.5
Square81,213,566,588,449
Cube731,885,048,555,080,239,793
Square root3,001.975516223≈irrational, shown to 9 decimal places
Cube root208.099688716≈
Negation-9,011,857
Reciprocal1.10964921 × 10^-7≈
Representations
Decimal9,011,857
Binary10001001100000101001000124 bits
Octal42301221
Hexadecimal898291
Base 365D5LD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, eleven thousand, eight hundred and fifty-seven
Ordinalnine million, eleven thousand, eight hundred and fifty-seventh
Scientific notation9.011857 × 10^6
Engineering notation9.011857 × 10^6
In other bases
Ternary121221211221111base 3; the most digit-efficient integer base after e: 15 digits
Quinary4301334412base 5; one hand: 10 digits
Septenary136412431base 7: 9 digits
Nonary17854844base 9; each digit is two ternary digits: 8 digits
Duodecimal3027241base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2g69chbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal41:43:17:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T00T0TT0T1111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100111101000011110010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100010011000001010010001
Bit length24 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits16within that length
Bit parityeven8 set bits, so even; 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 82 91
Gray code110011010100001111011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100010011000001010010001
64-bit0000000000000000000000000000000000000000100010011000001010010001
One's complement11111111011101100111110101101110at 32 bits, every bit flipped
Bits reversed10001001010000011001000100000000at 32 bits
Rotated left by 100000001000100110000010100100010at 32 bits, wrapping
Shifted left by 11000100110000010100100010= 18,023,714, no wrap
Shifted right by 110001001100000101001000= 4,505,928, discarding the low bit
These bits as a double4.45244895 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,011,857 to the power 281,213,566,588,449
9,011,857 to the power 3731,885,048,555,080,239,793
9,011,857 to the power 46,595,643,398,016,439,744,540,225,601
9,011,857 to the power 559,438,995,125,918,238,626,913,043,863,951,057
First ten multiples9,011,857, 18,023,714, 27,035,571, 36,047,428, 45,059,285, 54,071,142, 63,082,999, 72,094,856, 81,106,713, 90,118,570
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 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 1
Divisible by 100No, remainder 57
Collatz (3n + 1) trajectory
Steps to reach 1163the total stopping time
Highest value reached27,035,5723× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,011,857 → 27,035,572 → 13,517,786 → 6,758,893 → 20,276,680 → 10,138,340 → 5,069,170 → 2,534,585 → 7,603,756 → 3,801,878 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage901,185,700%
9,011,857% as a decimal90,118.57
9,011,857% of 1009,011,857
9,011,857% of 1,00090,118,570
As a fraction of 1009,011,857/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,011,857
Nerdulate something else
Nothing in mind? Surprise me · today’s page