Base | Representation |
---|---|
bin | 100100011101101010100… |
… | …0100010110100001111101 |
3 | 122202002120111201200111002 |
4 | 1020323111010112201331 |
5 | 1124102031134230010 |
6 | 14354130533540045 |
7 | 1025032542602546 |
oct | 110732504264175 |
9 | 18662514650432 |
10 | 5011506555005 |
11 | 1662405889655 |
12 | 68b31b4a4625 |
13 | 2a4776c2a4b2 |
14 | 1347b5a374cd |
15 | 8a5629c11a5 |
hex | 48ed511687d |
5011506555005 has 16 divisors (see below), whose sum is σ = 6330384446400. Its totient is φ = 3798158215680.
The previous prime is 5011506554993. The next prime is 5011506555017. The reversal of 5011506555005 is 5005556051105.
It is a happy number.
5011506555005 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (5011506554993) and next prime (5011506555017).
It is not a de Polignac number, because 5011506555005 - 242 = 613460043901 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5011506555005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13971341 + ... + 14325549.
It is an arithmetic number, because the mean of its divisors is an integer number (395649027900).
Almost surely, 25011506555005 is an apocalyptic number.
It is an amenable number.
5011506555005 is a deficient number, since it is larger than the sum of its proper divisors (1318877891395).
5011506555005 is a wasteful number, since it uses less digits than its factorization.
5011506555005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 503164.
The product of its (nonzero) digits is 93750, while the sum is 38.
The spelling of 5011506555005 in words is "five trillion, eleven billion, five hundred six million, five hundred fifty-five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •