Base | Representation |
---|---|
bin | 100100011000110100101… |
… | …1100110101111010110010 |
3 | 122201002202000211220121000 |
4 | 1020301221130311322302 |
5 | 1123414233420213411 |
6 | 14345251223142430 |
7 | 1024214123652021 |
oct | 110615134657262 |
9 | 18632660756530 |
10 | 5001111101106 |
11 | 1658a6092423a |
12 | 6892b9ba4a16 |
13 | 2a37ab330a43 |
14 | 1340ab1748b8 |
15 | 8a15504b956 |
hex | 48c69735eb2 |
5001111101106 has 64 divisors (see below), whose sum is σ = 11307974400000. Its totient is φ = 1637908051536.
The previous prime is 5001111101053. The next prime is 5001111101113. The reversal of 5001111101106 is 6011011111005.
It is a happy number.
It is a super-2 number, since 2×50011111011062 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5568795 + ... + 6404193.
It is an arithmetic number, because the mean of its divisors is an integer number (176687100000).
Almost surely, 25001111101106 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5001111101106, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5653987200000).
5001111101106 is an abundant number, since it is smaller than the sum of its proper divisors (6306863298894).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5001111101106 is a wasteful number, since it uses less digits than its factorization.
5001111101106 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 837348 (or 837342 counting only the distinct ones).
The product of its (nonzero) digits is 30, while the sum is 18.
The spelling of 5001111101106 in words is "five trillion, one billion, one hundred eleven million, one hundred one thousand, one hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •