Recognised as Number
9,913,889
- Positive
- Odd
- Prime
- 7 digits
9,913,889 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value9,913,889
Digit count7
Digit sum47
Digit product139,968
Multiplicative persistence5times 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 factorisation9,913,889
Distinct prime factors19,913,889
Number of divisors2
Sum of divisors σ(n)9,913,890
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,913,888integers below n that share no factor with it
Carmichael function λ(n)9,913,888the 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,913,8892 in total
Arithmetic
Previous number9,913,888
Next number9,913,890
Double19,827,778
Half4,956,944.5
Square98,285,195,104,321
Cube974,388,514,607,581,814,369
Square root3,148.632877933≈irrational, shown to 9 decimal places
Cube root214.823283671≈
Negation-9,913,889
Reciprocal1.0086859 × 10^-7≈
Representations
Decimal9,913,889
Binary10010111010001100010000124 bits
Octal45643041
Hexadecimal974621
Base 365WHLT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, nine hundred and thirteen thousand, eight hundred and eighty-nine
Ordinalnine million, nine hundred and thirteen thousand, eight hundred and eighty-ninth
Scientific notation9.913889 × 10^6
Engineering notation9.913889 × 10^6
In other bases
Ternary200122200022002base 3; the most digit-efficient integer base after e: 15 digits
Quinary10014221024base 5; one hand: 11 digits
Septenary150160316base 7: 9 digits
Nonary20580262base 9; each digit is two ternary digits: 8 digits
Duodecimal33a1255base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal31j4e9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal45:53:51:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T00T0010T01Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111010110101101001100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100101110100011000100001
Bit length24 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits14within that length
Bit parityeven10 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
Bytes397 46 21
Gray code110111001110010100110001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100101110100011000100001
64-bit0000000000000000000000000000000000000000100101110100011000100001
One's complement11111111011010001011100111011110at 32 bits, every bit flipped
Bits reversed10000100011000101110100100000000at 32 bits
Rotated left by 100000001001011101000110001000010at 32 bits, wrapping
Shifted left by 11001011101000110001000010= 19,827,778, no wrap
Shifted right by 110010111010001100010000= 4,956,944, discarding the low bit
These bits as a double4.89811197 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,913,889 to the power 298,285,195,104,321
9,913,889 to the power 3974,388,514,607,581,814,369
9,913,889 to the power 49,659,979,576,694,444,666,072,871,041
9,913,889 to the power 595,767,965,265,615,711,336,088,509,411,788,449
First ten multiples9,913,889, 19,827,778, 29,741,667, 39,655,556, 49,569,445, 59,483,334, 69,397,223, 79,311,112, 89,225,001, 99,138,890
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 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 7
Divisible by 12No, remainder 5
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1207the total stopping time
Highest value reached29,741,6683× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,913,889 → 29,741,668 → 14,870,834 → 7,435,417 → 22,306,252 → 11,153,126 → 5,576,563 → 16,729,690 → 8,364,845 → 25,094,536 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage991,388,900%
9,913,889% as a decimal99,138.89
9,913,889% of 1009,913,889
9,913,889% of 1,00099,138,890
As a fraction of 1009,913,889/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,913,889
Nerdulate something else
Nothing in mind? Surprise me · today’s page