Recognised as Number
9,993,241
- Positive
- Odd
- Composite
- 7 digits
9,993,241 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value9,993,241
Digit count7
Digit sum37
Digit product17,496
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 factorisation2,677 × 3,733
Distinct prime factors22,677, 3,733
Number of divisors4
Sum of divisors σ(n)9,999,652
Aliquot sum6,411sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,986,832integers below n that share no factor with it
Carmichael function λ(n)832,236the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 9,986,832
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2,677, 3,733, 9,993,2414 in total
Arithmetic
Previous number9,993,240
Next number9,993,242
Double19,986,482
Half4,996,620.5
Square99,864,865,684,081
Cube997,973,670,213,651,296,521
Square root3,161.20878779≈irrational, shown to 9 decimal places
Cube root215.39491865≈
Negation-9,993,241
Reciprocal1.00067636 × 10^-7≈
Representations
Decimal9,993,241
Binary10011000011111000001100124 bits
Octal46076031
Hexadecimal987C19
Base 365Y6U1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, nine hundred and ninety-three thousand, two hundred and forty-one
Ordinalnine million, nine hundred and ninety-three thousand, two hundred and forty-first
Scientific notation9.993241 × 10^6
Engineering notation9.993241 × 10^6
In other bases
Ternary200210201011001base 3; the most digit-efficient integer base after e: 15 digits
Quinary10024240431base 5; one hand: 11 digits
Septenary150640546base 7: 9 digits
Nonary20721131base 9; each digit is two ternary digits: 8 digits
Duodecimal341b161base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal329321base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal46:15:54:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T11T01011001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111010011000110001101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100110000111110000011001
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
Bytes398 7c 19
Gray code110101000100001000010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100110000111110000011001
64-bit0000000000000000000000000000000000000000100110000111110000011001
One's complement11111111011001111000001111100110at 32 bits, every bit flipped
Bits reversed10011000001111100001100100000000at 32 bits
Rotated left by 100000001001100001111100000110010at 32 bits, wrapping
Shifted left by 11001100001111100000110010= 19,986,482, no wrap
Shifted right by 110011000011111000001100= 4,996,620, discarding the low bit
These bits as a double4.93731707 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,993,241 to the power 299,864,865,684,081
9,993,241 to the power 3997,973,670,213,651,296,521
9,993,241 to the power 49,972,991,398,099,538,896,096,814,561
9,993,241 to the power 599,662,506,532,135,634,177,569,427,240,382,201
First ten multiples9,993,241, 19,986,482, 29,979,723, 39,972,964, 49,966,205, 59,959,446, 69,952,687, 79,945,928, 89,939,169, 99,932,410
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 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 41
Collatz (3n + 1) trajectory
Steps to reach 1163the total stopping time
Highest value reached60,777,5206× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,993,241 → 29,979,724 → 14,989,862 → 7,494,931 → 22,484,794 → 11,242,397 → 33,727,192 → 16,863,596 → 8,431,798 → 4,215,899 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage999,324,100%
9,993,241% as a decimal99,932.41
9,993,241% of 1009,993,241
9,993,241% of 1,00099,932,410
As a fraction of 1009,993,241/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,993,241
Nerdulate something else
Nothing in mind? Surprise me · today’s page