Recognised as Number
9,427,162
- Positive
- Even
- Composite
- 7 digits
9,427,162 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value9,427,162
Digit count7
Digit sum31
Digit product6,048
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 31 × 383 × 397
Distinct prime factors42, 31, 383, 397
Number of divisors16
Sum of divisors σ(n)14,671,872
Aliquot sum5,244,710sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,538,160integers below n that share no factor with it
Carmichael function λ(n)378,180the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,538,160
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 31, 62, 383, 397, 766, 794, 11,873, 12,307, 23,746, 24,614, 152,051, 304,102, 4,713,581, 9,427,16216 in total
Arithmetic
Previous number9,427,161
Next number9,427,163
Double18,854,324
Half4,713,581
Square88,871,383,374,244
Cube837,804,928,233,104,815,528
Square root3,070.368381807≈irrational, shown to 9 decimal places
Cube root211.248511129≈
Negation-9,427,162
Reciprocal1.06076463 × 10^-7≈
Representations
Decimal9,427,162
Binary10001111110110001101101024 bits
Octal43754332
Hexadecimal8FD8DA
Base 365M21M
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, four hundred and twenty-seven thousand, one hundred and sixty-two
Ordinalnine million, four hundred and twenty-seven thousand, one hundred and sixty-second
Scientific notation9.427162 × 10^6
Engineering notation9.427162 × 10^6
In other bases
Ternary122201221122011base 3; the most digit-efficient integer base after e: 15 digits
Quinary4403132122base 5; one hand: 10 digits
Septenary143062303base 7: 9 digits
Nonary18657564base 9; each digit is two ternary digits: 8 digits
Duodecimal31a764abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2ii7i2base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal43:38:39:22base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00T1T00TT0T011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100100000010100100101110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100011111101100011011010
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 even
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes38f d8 da
Gray code110010000011010010110111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100011111101100011011010
64-bit0000000000000000000000000000000000000000100011111101100011011010
One's complement11111111011100000010011100100101at 32 bits, every bit flipped
Bits reversed01011011000110111111000100000000at 32 bits
Rotated left by 100000001000111111011000110110100at 32 bits, wrapping
Shifted left by 11000111111011000110110100= 18,854,324, no wrap
Shifted right by 110001111110110001101101= 4,713,581, discarding the low bit
These bits as a double4.65763688 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,427,162 to the power 288,871,383,374,244
9,427,162 to the power 3837,804,928,233,104,815,528
9,427,162 to the power 47,898,122,782,851,852,858,962,571,536
9,427,162 to the power 574,456,882,969,835,238,901,603,313,806,460,832
First ten multiples9,427,162, 18,854,324, 28,281,486, 37,708,648, 47,135,810, 56,562,972, 65,990,134, 75,417,296, 84,844,458, 94,271,620
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 3
Divisible by 8No, remainder 2
Divisible by 9No, remainder 4
Divisible by 10No, remainder 2
Divisible by 11No, remainder 8
Divisible by 12No, remainder 10
Divisible by 100No, remainder 62
Collatz (3n + 1) trajectory
Steps to reach 1132the total stopping time
Highest value reached50,964,2085× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,427,162 → 4,713,581 → 14,140,744 → 7,070,372 → 3,535,186 → 1,767,593 → 5,302,780 → 2,651,390 → 1,325,695 → 3,977,086 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage942,716,200%
9,427,162% as a decimal94,271.62
9,427,162% of 1009,427,162
9,427,162% of 1,00094,271,620
As a fraction of 1009,427,162/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,427,162
Nerdulate something else
Nothing in mind? Surprise me · today’s page