Base | Representation |
---|---|
bin | 110011110010100111… |
… | …101111010010000111 |
3 | 12022112120020100021212 |
4 | 303302213233102013 |
5 | 1402342142023421 |
6 | 41314045402035 |
7 | 4006033100552 |
oct | 636247572207 |
9 | 168476210255 |
10 | 55610111111 |
11 | 21647504615 |
12 | a93b86931b |
13 | 53231274b9 |
14 | 299784b699 |
15 | 16a7164e5b |
hex | cf29ef487 |
55610111111 has 2 divisors, whose sum is σ = 55610111112. Its totient is φ = 55610111110.
The previous prime is 55610111083. The next prime is 55610111113. The reversal of 55610111111 is 11111101655.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 55610111111 - 26 = 55610111047 is a prime.
Together with 55610111113, it forms a pair of twin primes.
It is a Chen prime.
55610111111 is a modest number, since divided by 111111 gives 55610 as remainder.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (55610111113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27805055555 + 27805055556.
It is an arithmetic number, because the mean of its divisors is an integer number (27805055556).
Almost surely, 255610111111 is an apocalyptic number.
55610111111 is a deficient number, since it is larger than the sum of its proper divisors (1).
55610111111 is an equidigital number, since it uses as much as digits as its factorization.
55610111111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 150, while the sum is 23.
Adding to 55610111111 its reverse (11111101655), we get a palindrome (66721212766).
The spelling of 55610111111 in words is "fifty-five billion, six hundred ten million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •