Base | Representation |
---|---|
bin | 100101010011101010… |
… | …0010000000100000000 |
3 | 21122210110100122122000 |
4 | 1022213110100010000 |
5 | 2303034311440242 |
6 | 100445514544000 |
7 | 5534235066456 |
oct | 1124724200400 |
9 | 248713318560 |
10 | 80116515072 |
11 | 30a82758630 |
12 | 1363aa38000 |
13 | 772a30b749 |
14 | 3c404289d6 |
15 | 213d836a4c |
hex | 12a7510100 |
80116515072 has 576 divisors, whose sum is σ = 280992768000. Its totient is φ = 22245580800.
The previous prime is 80116515049. The next prime is 80116515109. The reversal of 80116515072 is 27051561108.
80116515072 is a `hidden beast` number, since 80 + 11 + 65 + 1 + 507 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (576).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 44781954 + ... + 44783742.
Almost surely, 280116515072 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 80116515072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (140496384000).
80116515072 is an abundant number, since it is smaller than the sum of its proper divisors (200876252928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
80116515072 is a wasteful number, since it uses less digits than its factorization.
80116515072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1875 (or 1855 counting only the distinct ones).
The product of its (nonzero) digits is 16800, while the sum is 36.
The spelling of 80116515072 in words is "eighty billion, one hundred sixteen million, five hundred fifteen thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •