Base | Representation |
---|---|
bin | 101001110001110111… |
… | …0101111111011000000 |
3 | 22120120202001200221000 |
4 | 1103203232233323000 |
5 | 2432221311410424 |
6 | 105114455332000 |
7 | 6324226443114 |
oct | 1234356577300 |
9 | 276522050830 |
10 | 89720028864 |
11 | 35060687694 |
12 | 1547b081000 |
13 | 85cab17a9b |
14 | 44b1a5d744 |
15 | 25019c73c9 |
hex | 14e3bafec0 |
89720028864 has 224 divisors, whose sum is σ = 266810378240. Its totient is φ = 29562983424.
The previous prime is 89720028863. The next prime is 89720028889. The reversal of 89720028864 is 46882002798.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a self number, because there is not a number n which added to its sum of digits gives 89720028864.
It is not an unprimeable number, because it can be changed into a prime (89720028863) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 60498267 + ... + 60499749.
It is an arithmetic number, because the mean of its divisors is an integer number (1191117760).
Almost surely, 289720028864 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 89720028864, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (133405189120).
89720028864 is an abundant number, since it is smaller than the sum of its proper divisors (177090349376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
89720028864 is a wasteful number, since it uses less digits than its factorization.
89720028864 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1884 (or 1868 counting only the distinct ones).
The product of its (nonzero) digits is 3096576, while the sum is 54.
The spelling of 89720028864 in words is "eighty-nine billion, seven hundred twenty million, twenty-eight thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •