Recognised as Number
9,028,589
- Positive
- Odd
- Prime
- 7 digits
9,028,589 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,028,589
Digit count7
Digit sum41
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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,028,589
Distinct prime factors19,028,589
Number of divisors2
Sum of divisors σ(n)9,028,590
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,028,588integers below n that share no factor with it
Carmichael function λ(n)9,028,588the 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,028,5892 in total
Arithmetic
Previous number9,028,588
Next number9,028,590
Double18,057,178
Half4,514,294.5
Square81,515,419,330,921
Cube735,969,218,301,540,700,469
Square root3,004.761055392≈irrational, shown to 9 decimal places
Cube root208.228399565≈
Negation-9,028,589
Reciprocal1.10759278 × 10^-7≈
Representations
Decimal9,028,589
Binary10001001110000111110110124 bits
Octal42341755
Hexadecimal89C3ED
Base 365DII5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, twenty-eight thousand, five hundred and eighty-nine
Ordinalnine million, twenty-eight thousand, five hundred and eighty-ninth
Scientific notation9.028589 × 10^6
Engineering notation9.028589 × 10^6
In other bases
Ternary121222200220012base 3; the most digit-efficient integer base after e: 15 digits
Quinary4302403324base 5; one hand: 10 digits
Septenary136512263base 7: 9 digits
Nonary17880805base 9; each digit is two ternary digits: 8 digits
Duodecimal3034a65base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2g8b99base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal41:47:56:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T000T010T01TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100111101100010000111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100010011100001111101101
Bit length24 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits11within that length
Bit parityodd13 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
Bytes389 c3 ed
Gray code110011010010001000011011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100010011100001111101101
64-bit0000000000000000000000000000000000000000100010011100001111101101
One's complement11111111011101100011110000010010at 32 bits, every bit flipped
Bits reversed10110111110000111001000100000000at 32 bits
Rotated left by 100000001000100111000011111011010at 32 bits, wrapping
Shifted left by 11000100111000011111011010= 18,057,178, no wrap
Shifted right by 110001001110000111110110= 4,514,294, discarding the low bit
These bits as a double4.46071566 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,028,589 to the power 281,515,419,330,921
9,028,589 to the power 3735,969,218,301,540,700,469
9,028,589 to the power 46,644,763,588,695,889,051,306,708,241
9,028,589 to the power 559,992,839,444,500,228,233,848,181,650,901,949
First ten multiples9,028,589, 18,057,178, 27,085,767, 36,114,356, 45,142,945, 54,171,534, 63,200,123, 72,228,712, 81,257,301, 90,285,890
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 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1287the total stopping time
Highest value reached185,323,44420× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,028,589 → 27,085,768 → 13,542,884 → 6,771,442 → 3,385,721 → 10,157,164 → 5,078,582 → 2,539,291 → 7,617,874 → 3,808,937 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage902,858,900%
9,028,589% as a decimal90,285.89
9,028,589% of 1009,028,589
9,028,589% of 1,00090,285,890
As a fraction of 1009,028,589/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,589
Nerdulate something else
Nothing in mind? Surprise me · today’s page