Base | Representation |
---|---|
bin | 10000000110000010… |
… | …10111100101101000 |
3 | 211022011212020012011 |
4 | 20003001113211220 |
5 | 120144000000000 |
6 | 3545222325304 |
7 | 424060046350 |
oct | 100301274550 |
9 | 24264766164 |
10 | 8640625000 |
11 | 37344534a7 |
12 | 1811889834 |
13 | a79193b77 |
14 | 5bd7c7b60 |
15 | 3588902ba |
hex | 203057968 |
8640625000 has 160 divisors (see below), whose sum is σ = 23437497600. Its totient is φ = 2925000000.
The previous prime is 8640624997. The next prime is 8640625031. The reversal of 8640625000 is 5260468.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 109374961 + ... + 109375039.
It is an arithmetic number, because the mean of its divisors is an integer number (146484360).
Almost surely, 28640625000 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 8640625000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11718748800).
8640625000 is an abundant number, since it is smaller than the sum of its proper divisors (14796872600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
8640625000 is an frugal number, since it uses more digits than its factorization.
8640625000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137 (or 93 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 31.
The square root of 8640625000 is about 92954.9622128910. The cubic root of 8640625000 is about 2052.0206132897.
Adding to 8640625000 its reverse (5260468), we get a palindrome (8645885468).
The spelling of 8640625000 in words is "eight billion, six hundred forty million, six hundred twenty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •