Base | Representation |
---|---|
bin | 100101001001101010110… |
… | …1001011100101011000000 |
3 | 200002010111022021112020001 |
4 | 1022103111221130223000 |
5 | 1132124044410410000 |
6 | 14505355551325344 |
7 | 1034616402104002 |
oct | 112232551345300 |
9 | 20063438245201 |
10 | 5106005560000 |
11 | 1699499030794 |
12 | 6a56b2b20854 |
13 | 2b0656b683b7 |
14 | 1391bc262372 |
15 | 8cc43ce146a |
hex | 4a4d5a5cac0 |
5106005560000 has 140 divisors (see below), whose sum is σ = 12714234017760. Its totient is φ = 2033852800000.
The previous prime is 5106005559983. The next prime is 5106005560001. The reversal of 5106005560000 is 655006015.
It is not an unprimeable number, because it can be changed into a prime (5106005560001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 9292950 + ... + 9827050.
Almost surely, 25106005560000 is an apocalyptic number.
5106005560000 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 5106005560000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6357117008880).
5106005560000 is an abundant number, since it is smaller than the sum of its proper divisors (7608228457760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5106005560000 is an equidigital number, since it uses as much as digits as its factorization.
5106005560000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 534372 (or 534347 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 28.
The spelling of 5106005560000 in words is "five trillion, one hundred six billion, five million, five hundred sixty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •