Base | Representation |
---|---|
bin | 101000001010110000001… |
… | …0011001100100001001111 |
3 | 201112202202111100102102112 |
4 | 1100111200103030201033 |
5 | 1210422242021320421 |
6 | 15424052335214235 |
7 | 1106565551004242 |
oct | 120254023144117 |
9 | 21482674312375 |
10 | 5520648620111 |
11 | 183932624a959 |
12 | 751b3207737b |
13 | 3107970a9841 |
14 | 1512b5093259 |
15 | 98910ee445b |
hex | 505604cc84f |
5520648620111 has 2 divisors, whose sum is σ = 5520648620112. Its totient is φ = 5520648620110.
The previous prime is 5520648620093. The next prime is 5520648620161. The reversal of 5520648620111 is 1110268460255.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5520648620111 - 230 = 5519574878287 is a prime.
It is a super-2 number, since 2×55206486201112 (a number of 26 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5520648620161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2760324310055 + 2760324310056.
It is an arithmetic number, because the mean of its divisors is an integer number (2760324310056).
Almost surely, 25520648620111 is an apocalyptic number.
5520648620111 is a deficient number, since it is larger than the sum of its proper divisors (1).
5520648620111 is an equidigital number, since it uses as much as digits as its factorization.
5520648620111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 115200, while the sum is 41.
The spelling of 5520648620111 in words is "five trillion, five hundred twenty billion, six hundred forty-eight million, six hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •