Base | Representation |
---|---|
bin | 110011101100011000… |
… | …101100101100100101 |
3 | 12022021021101210202201 |
4 | 303230120230230211 |
5 | 1402133402130221 |
6 | 41255431334501 |
7 | 4003323002626 |
oct | 635430545445 |
9 | 168237353681 |
10 | 55505505061 |
11 | 215a3457536 |
12 | a910821431 |
13 | 5307560326 |
14 | 29879bba4d |
15 | 169cda0891 |
hex | cec62cb25 |
55505505061 has 2 divisors, whose sum is σ = 55505505062. Its totient is φ = 55505505060.
The previous prime is 55505505047. The next prime is 55505505091. The reversal of 55505505061 is 16050550555.
55505505061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 55093008961 + 412496100 = 234719^2 + 20310^2 .
It is a cyclic number.
It is not a de Polignac number, because 55505505061 - 27 = 55505504933 is a prime.
It is a super-2 number, since 2×555055050612 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 55505505061.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (55505505031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27752752530 + 27752752531.
It is an arithmetic number, because the mean of its divisors is an integer number (27752752531).
Almost surely, 255505505061 is an apocalyptic number.
It is an amenable number.
55505505061 is a deficient number, since it is larger than the sum of its proper divisors (1).
55505505061 is an equidigital number, since it uses as much as digits as its factorization.
55505505061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 93750, while the sum is 37.
The spelling of 55505505061 in words is "fifty-five billion, five hundred five million, five hundred five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •