Recognised as Number
9,442,931
- Positive
- Odd
- Prime
- 7 digits
9,442,931 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value9,442,931
Digit count7
Digit sum32
Digit product7,776
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation9,442,931
Distinct prime factors19,442,931
Number of divisors2
Sum of divisors σ(n)9,442,932
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,442,930integers below n that share no factor with it
Carmichael function λ(n)9,442,930the 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,442,9312 in total
Arithmetic
Previous number9,442,930
Next number9,442,932
Double18,885,862
Half4,721,465.5
Square89,168,945,870,761
Cube842,016,203,200,331,040,491
Square root3,072.935241752≈irrational, shown to 9 decimal places
Cube root211.366232034≈
Negation-9,442,931
Reciprocal1.05899323 × 10^-7≈
Representations
Decimal9,442,931
Binary10010000000101100111001124 bits
Octal44013163
Hexadecimal901673
Base 365ME7N
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, four hundred and forty-two thousand, nine hundred and thirty-one
Ordinalnine million, four hundred and forty-two thousand, nine hundred and thirty-first
Scientific notation9.442931 × 10^6
Engineering notation9.442931 × 10^6
In other bases
Ternary122202202021012base 3; the most digit-efficient integer base after e: 15 digits
Quinary4404133211base 5; one hand: 10 digits
Septenary143156261base 7: 9 digits
Nonary18682235base 9; each digit is two ternary digits: 8 digits
Duodecimal31b47abbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2j076bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal43:43:2:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00T10T1T1T11TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100100000110101110110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100100000001011001110011
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
Bytes390 16 73
Gray code110110000001110101001010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100100000001011001110011
64-bit0000000000000000000000000000000000000000100100000001011001110011
One's complement11111111011011111110100110001100at 32 bits, every bit flipped
Bits reversed11001110011010000000100100000000at 32 bits
Rotated left by 100000001001000000010110011100110at 32 bits, wrapping
Shifted left by 11001000000010110011100110= 18,885,862, no wrap
Shifted right by 110010000000101100111001= 4,721,465, discarding the low bit
These bits as a double4.6654278 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,442,931 to the power 289,168,945,870,761
9,442,931 to the power 3842,016,203,200,331,040,491
9,442,931 to the power 47,951,100,907,702,705,192,514,719,121
9,442,931 to the power 575,081,697,245,474,013,646,258,209,143,983,651
First ten multiples9,442,931, 18,885,862, 28,328,793, 37,771,724, 47,214,655, 56,657,586, 66,100,517, 75,543,448, 84,986,379, 94,429,310
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 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 11
Divisible by 100No, remainder 31
Collatz (3n + 1) trajectory
Steps to reach 1181the total stopping time
Highest value reached1,678,460,992177× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,442,931 → 28,328,794 → 14,164,397 → 42,493,192 → 21,246,596 → 10,623,298 → 5,311,649 → 15,934,948 → 7,967,474 → 3,983,737 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage944,293,100%
9,442,931% as a decimal94,429.31
9,442,931% of 1009,442,931
9,442,931% of 1,00094,429,310
As a fraction of 1009,442,931/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,442,931
Nerdulate something else
Nothing in mind? Surprise me · today’s page