Recognised as Number
9,028,170
- Positive
- Even
- Composite
- 7 digits
9,028,170 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value9,028,170
Digit count7
Digit sum27
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3^2 × 5 × 100,313
Distinct prime factors42, 3, 5, 100,313
Number of divisors24
Sum of divisors σ(n)23,473,476
Aliquot sum14,445,306sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)2,407,488integers below n that share no factor with it
Carmichael function λ(n)300,936the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,407,488
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90, 100,313, 200,626, 300,939, 501,565, 601,878, 902,817, 1,003,130, 1,504,695, 1,805,634, 3,009,390, 4,514,085, 9,028,17024 in total
Arithmetic
Previous number9,028,169
Next number9,028,171
Double18,056,340
Half4,514,085
Square81,507,853,548,900
Cube735,866,758,174,572,513,000
Square root3,004.691331901≈irrational, shown to 9 decimal places
Cube root208.225178351≈
Negation-9,028,170
Reciprocal1.10764418 × 10^-7≈
Representations
Decimal9,028,170
Binary10001001110000100100101024 bits
Octal42341112
Hexadecimal89C24A
Base 365DI6I
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, twenty-eight thousand, one hundred and seventy
Ordinalnine million, twenty-eight thousand, one hundred and seventieth
Scientific notation9.02817 × 10^6
Engineering notation9.02817 × 10^6
In other bases
Ternary121222200022200base 3; the most digit-efficient integer base after e: 15 digits
Quinary4302400140base 5; one hand: 10 digits
Septenary136511124base 7: 9 digits
Nonary17880280base 9; each digit is two ternary digits: 8 digits
Duodecimal3034776base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2g8a8abase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal41:47:49:30base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T000T00100T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100111101100011001011110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100010011100001001001010
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 even
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes389 c2 4a
Gray code110011010010001101101111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100010011100001001001010
64-bit0000000000000000000000000000000000000000100010011100001001001010
One's complement11111111011101100011110110110101at 32 bits, every bit flipped
Bits reversed01010010010000111001000100000000at 32 bits
Rotated left by 100000001000100111000010010010100at 32 bits, wrapping
Shifted left by 11000100111000010010010100= 18,056,340, no wrap
Shifted right by 110001001110000100100101= 4,514,085, discarding the low bit
These bits as a double4.46050864 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,028,170 to the power 281,507,853,548,900
9,028,170 to the power 3735,866,758,174,572,513,000
9,028,170 to the power 46,643,530,190,148,930,324,691,210,000
9,028,170 to the power 559,978,919,956,796,868,289,467,441,385,700,000
First ten multiples9,028,170, 18,056,340, 27,084,510, 36,112,680, 45,140,850, 54,169,020, 63,197,190, 72,225,360, 81,253,530, 90,281,700
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6Yes
Divisible by 7No, remainder 4
Divisible by 8No, remainder 2
Divisible by 9Yes
Divisible by 10Yes
Divisible by 11No, remainder 8
Divisible by 12No, remainder 6
Divisible by 100No, remainder 70
Collatz (3n + 1) trajectory
Steps to reach 1225the total stopping time
Highest value reached65,964,2927× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,028,170 → 4,514,085 → 13,542,256 → 6,771,128 → 3,385,564 → 1,692,782 → 846,391 → 2,539,174 → 1,269,587 → 3,808,762 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage902,817,000%
9,028,170% as a decimal90,281.7
9,028,170% of 1009,028,170
9,028,170% of 1,00090,281,700
As a fraction of 1009,028,170/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,028,170
Nerdulate something else
Nothing in mind? Surprise me · today’s page