Base | Representation |
---|---|
bin | 100101010010110100… |
… | …1110010110010000000 |
3 | 21122201111211211011000 |
4 | 1022211221302302000 |
5 | 2303010140422442 |
6 | 100443040452000 |
7 | 5533445635410 |
oct | 1124551626200 |
9 | 248644754130 |
10 | 80088607872 |
11 | 30a68a27529 |
12 | 1363161a000 |
13 | 77245ba200 |
14 | 3c3a842640 |
15 | 213b172d4c |
hex | 12a5a72c80 |
80088607872 has 768 divisors, whose sum is σ = 308212992000. Its totient is φ = 19991162880.
The previous prime is 80088607871. The next prime is 80088607903. The reversal of 80088607872 is 27870688008.
It is a super-2 number, since 2×800886078722 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is not an unprimeable number, because it can be changed into a prime (80088607871) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 77679997 + ... + 77681027.
It is an arithmetic number, because the mean of its divisors is an integer number (401319000).
Almost surely, 280088607872 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 80088607872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (154106496000).
80088607872 is an abundant number, since it is smaller than the sum of its proper divisors (228124384128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
80088607872 is a wasteful number, since it uses less digits than its factorization.
80088607872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1106 (or 1075 counting only the distinct ones).
The product of its (nonzero) digits is 2408448, while the sum is 54.
The spelling of 80088607872 in words is "eighty billion, eighty-eight million, six hundred seven thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •