Recognised as Number
9,928,999
- Positive
- Odd
- Prime
- 7 digits
9,928,999 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,928,999
Digit count7
Digit sum55
Digit product944,784
Multiplicative persistence4times 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,928,999
Distinct prime factors19,928,999
Number of divisors2
Sum of divisors σ(n)9,929,000
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,928,998integers below n that share no factor with it
Carmichael function λ(n)9,928,998the 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,928,9992 in total
Arithmetic
Previous number9,928,998
Next number9,929,000
Double19,857,998
Half4,964,499.5
Square98,585,021,142,001
Cube978,850,576,333,906,786,999
Square root3,151.031418441≈irrational, shown to 9 decimal places
Cube root214.932367406≈
Negation-9,928,999
Reciprocal1.00715087 × 10^-7≈
Representations
Decimal9,928,999
Binary10010111100000010010011124 bits
Octal45700447
Hexadecimal978127
Base 365WT9J
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, nine hundred and twenty-eight thousand, nine hundred and ninety-nine
Ordinalnine million, nine hundred and twenty-eight thousand, nine hundred and ninety-ninth
Scientific notation9.928999 × 10^6
Engineering notation9.928999 × 10^6
In other bases
Ternary200200110000201base 3; the most digit-efficient integer base after e: 15 digits
Quinary10020211444base 5; one hand: 11 digits
Septenary150252343base 7: 9 digits
Nonary20613021base 9; each digit is two ternary digits: 8 digits
Duodecimal33a9b47base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal32129jbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal45:58:3:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T00110001T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111010001000000101111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100101111000000100100111
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
Bytes397 81 27
Gray code110111000100000110110100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100101111000000100100111
64-bit0000000000000000000000000000000000000000100101111000000100100111
One's complement11111111011010000111111011011000at 32 bits, every bit flipped
Bits reversed11100100100000011110100100000000at 32 bits
Rotated left by 100000001001011110000001001001110at 32 bits, wrapping
Shifted left by 11001011110000001001001110= 19,857,998, no wrap
Shifted right by 110010111100000010010011= 4,964,499, discarding the low bit
These bits as a double4.9055773 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,928,999 to the power 298,585,021,142,001
9,928,999 to the power 3978,850,576,333,906,786,999
9,928,999 to the power 49,719,006,393,568,784,154,206,284,001
9,928,999 to the power 596,500,004,762,738,064,298,330,039,639,644,999
First ten multiples9,928,999, 19,857,998, 29,786,997, 39,715,996, 49,644,995, 59,573,994, 69,502,993, 79,431,992, 89,360,991, 99,289,990
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 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 3
Divisible by 12No, remainder 7
Divisible by 100No, remainder 99
Collatz (3n + 1) trajectory
Steps to reach 188the total stopping time
Highest value reached75,398,3447× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,928,999 → 29,786,998 → 14,893,499 → 44,680,498 → 22,340,249 → 67,020,748 → 33,510,374 → 16,755,187 → 50,265,562 → 25,132,781 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage992,899,900%
9,928,999% as a decimal99,289.99
9,928,999% of 1009,928,999
9,928,999% of 1,00099,289,990
As a fraction of 1009,928,999/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,928,999
Nerdulate something else
Nothing in mind? Surprise me · today’s page