Base | Representation |
---|---|
bin | 100101100100101101… |
… | …1011001110010001000 |
3 | 21201021100020111212112 |
4 | 1023021123121302020 |
5 | 2310222314041430 |
6 | 101022401201452 |
7 | 5554354420205 |
oct | 1131133316210 |
9 | 251240214775 |
10 | 80688815240 |
11 | 31246807180 |
12 | 1377a630288 |
13 | 77bba592b7 |
14 | 3c96440cac |
15 | 2173bd2195 |
hex | 12c96d9c88 |
80688815240 has 128 divisors (see below), whose sum is σ = 200197008000. Its totient is φ = 29024870400.
The previous prime is 80688815201. The next prime is 80688815287. The reversal of 80688815240 is 4251888608.
It is a happy number.
It is a hoax number, since the sum of its digits (50) coincides with the sum of the digits of its distinct prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 44553935 + ... + 44555745.
It is an arithmetic number, because the mean of its divisors is an integer number (1564039125).
Almost surely, 280688815240 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 80688815240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (100098504000).
80688815240 is an abundant number, since it is smaller than the sum of its proper divisors (119508192760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
80688815240 is a wasteful number, since it uses less digits than its factorization.
80688815240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2871 (or 2867 counting only the distinct ones).
The product of its (nonzero) digits is 983040, while the sum is 50.
The spelling of 80688815240 in words is "eighty billion, six hundred eighty-eight million, eight hundred fifteen thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •