Base | Representation |
---|---|
bin | 1010100111110… |
… | …11001001010000 |
3 | 20012200012200000 |
4 | 11103323021100 |
5 | 140302442242 |
6 | 12501530000 |
7 | 2131262133 |
oct | 523731120 |
9 | 205605600 |
10 | 89109072 |
11 | 46332a68 |
12 | 25a13900 |
13 | 155cc580 |
14 | bb9821a |
15 | 7c52a4c |
hex | 54fb250 |
89109072 has 240 divisors, whose sum is σ = 291939648. Its totient is φ = 26127360.
The previous prime is 89109071. The next prime is 89109079. The reversal of 89109072 is 27090198.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (89109071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2072283 + ... + 2072325.
Almost surely, 289109072 is an apocalyptic number.
89109072 is a gapful number since it is divisible by the number (82) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 89109072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (145969824).
89109072 is an abundant number, since it is smaller than the sum of its proper divisors (202830576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
89109072 is a wasteful number, since it uses less digits than its factorization.
89109072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120 (or 102 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 36.
The square root of 89109072 is about 9439.7601664449. The cubic root of 89109072 is about 446.6568241191.
The spelling of 89109072 in words is "eighty-nine million, one hundred nine thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •