Base | Representation |
---|---|
bin | 100100011000110001100… |
… | …1100010100010111111110 |
3 | 122201002110201021121112110 |
4 | 1020301203030110113332 |
5 | 1123414030030343420 |
6 | 14345232552514450 |
7 | 1024211410344120 |
oct | 110614314242776 |
9 | 18632421247473 |
10 | 5001006106110 |
11 | 1658a07630a13 |
12 | 68928a9aba26 |
13 | 2a379265b821 |
14 | 13409b243210 |
15 | 8a14ac0bee0 |
hex | 48c633145fe |
5001006106110 has 192 divisors, whose sum is σ = 14518550592000. Its totient is φ = 1079815981824.
The previous prime is 5001006106097. The next prime is 5001006106111. The reversal of 5001006106110 is 116016001005.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5001006106111) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 26363181 + ... + 26552199.
It is an arithmetic number, because the mean of its divisors is an integer number (75617451000).
Almost surely, 25001006106110 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5001006106110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7259275296000).
5001006106110 is an abundant number, since it is smaller than the sum of its proper divisors (9517544485890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5001006106110 is a wasteful number, since it uses less digits than its factorization.
5001006106110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 189423 (or 189404 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 21.
The spelling of 5001006106110 in words is "five trillion, one billion, six million, one hundred six thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •