Recognised as Number
9,393,991
- Positive
- Odd
- Prime
- 7 digits
9,393,991 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,393,991
Digit count7
Digit sum43
Digit product59,049
Multiplicative persistence2times 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,393,991
Distinct prime factors19,393,991
Number of divisors2
Sum of divisors σ(n)9,393,992
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,393,990integers below n that share no factor with it
Carmichael function λ(n)9,393,990the 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,393,9912 in total
Arithmetic
Previous number9,393,990
Next number9,393,992
Double18,787,982
Half4,696,995.5
Square88,247,066,908,081
Cube828,992,152,310,910,741,271
Square root3,064.961826842≈irrational, shown to 9 decimal places
Cube root211.000449225≈
Negation-9,393,991
Reciprocal1.06451028 × 10^-7≈
Representations
Decimal9,393,991
Binary10001111010101110100011124 bits
Octal43653507
Hexadecimal8F5747
Base 365LCG7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, three hundred and ninety-three thousand, nine hundred and ninety-one
Ordinalnine million, three hundred and ninety-three thousand, nine hundred and ninety-first
Scientific notation9.393991 × 10^6
Engineering notation9.393991 × 10^6
In other bases
Ternary122200021010121base 3; the most digit-efficient integer base after e: 15 digits
Quinary4401101431base 5; one hand: 10 digits
Septenary142563505base 7: 9 digits
Nonary18607117base 9; each digit is two ternary digits: 8 digits
Duodecimal3190407base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2ie4jbbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal43:29:26:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00T001T1011TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100100001010101101011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100011110101011101000111
Bit length24 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits10within that length
Bit parityeven14 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
Bytes38f 57 47
Gray code110010001111110011100100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100011110101011101000111
64-bit0000000000000000000000000000000000000000100011110101011101000111
One's complement11111111011100001010100010111000at 32 bits, every bit flipped
Bits reversed11100010111010101111000100000000at 32 bits
Rotated left by 100000001000111101010111010001110at 32 bits, wrapping
Shifted left by 11000111101010111010001110= 18,787,982, no wrap
Shifted right by 110001111010101110100011= 4,696,995, discarding the low bit
These bits as a double4.64124823 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,393,991 to the power 288,247,066,908,081
9,393,991 to the power 3828,992,152,310,910,741,271
9,393,991 to the power 47,787,544,817,879,324,705,303,102,561
9,393,991 to the power 573,156,125,931,255,015,367,694,997,730,110,951
First ten multiples9,393,991, 18,787,982, 28,181,973, 37,575,964, 46,969,955, 56,363,946, 65,757,937, 75,151,928, 84,545,919, 93,939,910
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 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 7
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 1176the total stopping time
Highest value reached80,252,5848× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,393,991 → 28,181,974 → 14,090,987 → 42,272,962 → 21,136,481 → 63,409,444 → 31,704,722 → 15,852,361 → 47,557,084 → 23,778,542 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage939,399,100%
9,393,991% as a decimal93,939.91
9,393,991% of 1009,393,991
9,393,991% of 1,00093,939,910
As a fraction of 1009,393,991/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,393,991
Nerdulate something else
Nothing in mind? Surprise me · today’s page