Base | Representation |
---|---|
bin | 100101100001001100… |
… | …0110101000011100000 |
3 | 21200222002222122020000 |
4 | 1023002120311003200 |
5 | 2310002044400000 |
6 | 101002541420000 |
7 | 5551421436000 |
oct | 1130230650340 |
9 | 250862878200 |
10 | 80570700000 |
11 | 3119607247a |
12 | 13746b6a600 |
13 | 77a044221b |
14 | 3c84896000 |
15 | 2168650000 |
hex | 12c26350e0 |
80570700000 has 1440 divisors, whose sum is σ = 357305256000. Its totient is φ = 17781120000.
The previous prime is 80570699969. The next prime is 80570700013. The reversal of 80570700000 is 707508.
It is a tau number, because it is divible by the number of its divisors (1440).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 239 ways as a sum of consecutive naturals, for example, 2778299986 + ... + 2778300014.
It is an arithmetic number, because the mean of its divisors is an integer number (248128650).
Almost surely, 280570700000 is an apocalyptic number.
80570700000 is a gapful number since it is divisible by the number (80) 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 80570700000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (178652628000).
80570700000 is an abundant number, since it is smaller than the sum of its proper divisors (276734556000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
80570700000 is an frugal number, since it uses more digits than its factorization.
80570700000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 97 (or 46 counting only the distinct ones).
The product of its (nonzero) digits is 1960, while the sum is 27.
The spelling of 80570700000 in words is "eighty billion, five hundred seventy million, seven hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •