Recognised as Number
9,990,403
- Positive
- Odd
- Prime
- 7 digits
9,990,403 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value9,990,403
Digit count7
Digit sum34
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation9,990,403
Distinct prime factors19,990,403
Number of divisors2
Sum of divisors σ(n)9,990,404
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,990,402integers below n that share no factor with it
Carmichael function λ(n)9,990,402the 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,990,4032 in total
Arithmetic
Previous number9,990,402
Next number9,990,404
Double19,980,806
Half4,995,201.5
Square99,808,152,102,409
Cube997,123,662,188,363,180,827
Square root3,160.759876992≈irrational, shown to 9 decimal places
Cube root215.374526578≈
Negation-9,990,403
Reciprocal1.00096062 × 10^-7≈
Representations
Decimal9,990,403
Binary10011000011100010000001124 bits
Octal46070403
Hexadecimal987103
Base 365Y4N7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, nine hundred and ninety thousand, four hundred and three
Ordinalnine million, nine hundred and ninety thousand, four hundred and third
Scientific notation9.990403 × 10^6
Engineering notation9.990403 × 10^6
In other bases
Ternary200210120020221base 3; the most digit-efficient integer base after e: 15 digits
Quinary10024143103base 5; one hand: 11 digits
Septenary150626353base 7: 9 digits
Nonary20716227base 9; each digit is two ternary digits: 8 digits
Duodecimal3419597base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal328g03base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal46:15:6:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T11TT01T10T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111010011011000100000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100110000111000100000011
Bit length24 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits15within that length
Bit parityodd9 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
Bytes398 71 03
Gray code110101000100100110000010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100110000111000100000011
64-bit0000000000000000000000000000000000000000100110000111000100000011
One's complement11111111011001111000111011111100at 32 bits, every bit flipped
Bits reversed11000000100011100001100100000000at 32 bits
Rotated left by 100000001001100001110001000000110at 32 bits, wrapping
Shifted left by 11001100001110001000000110= 19,980,806, no wrap
Shifted right by 110011000011100010000001= 4,995,201, discarding the low bit
These bits as a double4.93591491 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,990,403 to the power 299,808,152,102,409
9,990,403 to the power 3997,123,662,188,363,180,827
9,990,403 to the power 49,961,667,226,097,610,086,823,603,281
9,990,403 to the power 599,521,070,140,607,242,104,232,786,689,312,243
First ten multiples9,990,403, 19,980,806, 29,971,209, 39,961,612, 49,952,015, 59,942,418, 69,932,821, 79,923,224, 89,913,627, 99,904,030
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 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 7
Divisible by 100No, remainder 3
Collatz (3n + 1) trajectory
Steps to reach 1145the total stopping time
Highest value reached44,956,8164× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,990,403 → 29,971,210 → 14,985,605 → 44,956,816 → 22,478,408 → 11,239,204 → 5,619,602 → 2,809,801 → 8,429,404 → 4,214,702 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage999,040,300%
9,990,403% as a decimal99,904.03
9,990,403% of 1009,990,403
9,990,403% of 1,00099,904,030
As a fraction of 1009,990,403/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,990,403
Nerdulate something else
Nothing in mind? Surprise me · today’s page