Base | Representation |
---|---|
bin | 100100011000100010110… |
… | …1011110110011011110101 |
3 | 122201001012012202102220120 |
4 | 1020301011223312123311 |
5 | 1123412021312234410 |
6 | 14345111510122153 |
7 | 1024163216443152 |
oct | 110610553663365 |
9 | 18631165672816 |
10 | 5000511055605 |
11 | 165878314516a |
12 | 689171050359 |
13 | 2a3713c1a530 |
14 | 1340515b9229 |
15 | 8a11c520570 |
hex | 48c45af66f5 |
5000511055605 has 32 divisors (see below), whose sum is σ = 8661376604160. Its totient is φ = 2448901086720.
The previous prime is 5000511055537. The next prime is 5000511055633. The reversal of 5000511055605 is 5065501150005.
It is not a de Polignac number, because 5000511055605 - 211 = 5000511053557 is a prime.
It is a super-2 number, since 2×50005110556052 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 67092720 + ... + 67167209.
It is an arithmetic number, because the mean of its divisors is an integer number (270668018880).
Almost surely, 25000511055605 is an apocalyptic number.
It is an amenable number.
5000511055605 is a deficient number, since it is larger than the sum of its proper divisors (3660865548555).
5000511055605 is a wasteful number, since it uses less digits than its factorization.
5000511055605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134260141.
The product of its (nonzero) digits is 18750, while the sum is 33.
The spelling of 5000511055605 in words is "five trillion, five hundred eleven million, fifty-five thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •