Base | Representation |
---|---|
bin | 1010010101101111… |
… | …10011101110010101 |
3 | 112022212101122210222 |
4 | 11022313303232111 |
5 | 42332041023221 |
6 | 2314455324125 |
7 | 254363444156 |
oct | 51267635625 |
9 | 15285348728 |
10 | 5551111061 |
11 | 23995039a1 |
12 | 10ab080645 |
13 | 6a609aa02 |
14 | 3a935d92d |
15 | 2275189ab |
hex | 14adf3b95 |
5551111061 has 2 divisors, whose sum is σ = 5551111062. Its totient is φ = 5551111060.
The previous prime is 5551111057. The next prime is 5551111087. The reversal of 5551111061 is 1601111555.
It is an a-pointer prime, because the next prime (5551111087) can be obtained adding 5551111061 to its sum of digits (26).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3937562500 + 1613548561 = 62750^2 + 40169^2 .
It is a cyclic number.
It is not a de Polignac number, because 5551111061 - 22 = 5551111057 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 5551111061.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5551111021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2775555530 + 2775555531.
It is an arithmetic number, because the mean of its divisors is an integer number (2775555531).
Almost surely, 25551111061 is an apocalyptic number.
It is an amenable number.
5551111061 is a deficient number, since it is larger than the sum of its proper divisors (1).
5551111061 is an equidigital number, since it uses as much as digits as its factorization.
5551111061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 750, while the sum is 26.
The square root of 5551111061 is about 74505.7787087686. The cubic root of 5551111061 is about 1770.6251912783.
The spelling of 5551111061 in words is "five billion, five hundred fifty-one million, one hundred eleven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •