Base | Representation |
---|---|
bin | 100101001100000001011… |
… | …1110110101111100011011 |
3 | 200002121112122012002211012 |
4 | 1022120002332311330123 |
5 | 1132214423121014210 |
6 | 14511553345324135 |
7 | 1035155600424311 |
oct | 112300276657433 |
9 | 20077478162735 |
10 | 5111061110555 |
11 | 16a065282a744 |
12 | 6a668403664b |
13 | 2b0c8137692a |
14 | 13953b8640b1 |
15 | 8ce3ca6c305 |
hex | 4a602fb5f1b |
5111061110555 has 32 divisors (see below), whose sum is σ = 6831660579840. Its totient is φ = 3653040504960.
The previous prime is 5111061110549. The next prime is 5111061110591. The reversal of 5111061110555 is 5550111601115.
It is a de Polignac number, because none of the positive numbers 2k-5111061110555 is a prime.
It is a super-2 number, since 2×51110611105552 (a number of 26 digits) contains 22 as substring.
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, 16317812 + ... + 16628081.
It is an arithmetic number, because the mean of its divisors is an integer number (213489393120).
Almost surely, 25111061110555 is an apocalyptic number.
5111061110555 is a deficient number, since it is larger than the sum of its proper divisors (1720599469285).
5111061110555 is a wasteful number, since it uses less digits than its factorization.
5111061110555 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32946011.
The product of its (nonzero) digits is 3750, while the sum is 32.
The spelling of 5111061110555 in words is "five trillion, one hundred eleven billion, sixty-one million, one hundred ten thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •