Base | Representation |
---|---|
bin | 100100011011001001101… |
… | …1010100011010100011000 |
3 | 122201120122102100220222121 |
4 | 1020312103122203110120 |
5 | 1124010003142023000 |
6 | 14351435241231024 |
7 | 1024452034563625 |
oct | 110662332432430 |
9 | 18646572326877 |
10 | 5006110111000 |
11 | 1660096715379 |
12 | 68a274192474 |
13 | 2a40c6c03a6b |
14 | 13442305934c |
15 | 8a348d59b1a |
hex | 48d936a3518 |
5006110111000 has 64 divisors (see below), whose sum is σ = 11803720088160. Its totient is φ = 1987158160000.
The previous prime is 5006110110863. The next prime is 5006110111007. The reversal of 5006110111000 is 1110116005.
It is a super-2 number, since 2×50061101110002 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5006110111007) 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 15 ways as a sum of consecutive naturals, for example, 18976291 + ... + 19238290.
Almost surely, 25006110111000 is an apocalyptic number.
5006110111000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5006110111000 is an abundant number, since it is smaller than the sum of its proper divisors (6797609977160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5006110111000 is a wasteful number, since it uses less digits than its factorization.
5006110111000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38214733 (or 38214719 counting only the distinct ones).
The product of its (nonzero) digits is 30, while the sum is 16.
Adding to 5006110111000 its reverse (1110116005), we get a palindrome (5007220227005).
The spelling of 5006110111000 in words is "five trillion, six billion, one hundred ten million, one hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •