Base | Representation |
---|---|
bin | 1010011011110001… |
… | …01001011000100100 |
3 | 112110101111221100111 |
4 | 11031320221120210 |
5 | 42433011200000 |
6 | 2323503022404 |
7 | 255546226360 |
oct | 51570513044 |
9 | 15411457314 |
10 | 5601662500 |
11 | 2414aa0a45 |
12 | 1103b9aa04 |
13 | 6b36ba0c5 |
14 | 3b1d5c2a0 |
15 | 22bba1cba |
hex | 14de29624 |
5601662500 has 72 divisors (see below), whose sum is σ = 14003478720. Its totient is φ = 1920540000.
The previous prime is 5601662497. The next prime is 5601662509. The reversal of 5601662500 is 52661065.
It is not an unprimeable number, because it can be changed into a prime (5601662509) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 55491 + ... + 119509.
It is an arithmetic number, because the mean of its divisors is an integer number (194492760).
Almost surely, 25601662500 is an apocalyptic number.
5601662500 is a gapful number since it is divisible by the number (50) 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 5601662500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7001739360).
5601662500 is an abundant number, since it is smaller than the sum of its proper divisors (8401816220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5601662500 is an equidigital number, since it uses as much as digits as its factorization.
5601662500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64055 (or 64033 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 31.
The square root of 5601662500 is about 74844.2549565429. The cubic root of 5601662500 is about 1775.9837170984.
The spelling of 5601662500 in words is "five billion, six hundred one million, six hundred sixty-two thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •