Base | Representation |
---|---|
bin | 110011010111001100… |
… | …111101010111000011 |
3 | 12021100111122122222102 |
4 | 303113030331113003 |
5 | 1400421411343201 |
6 | 41200254101015 |
7 | 3661446111125 |
oct | 632714752703 |
9 | 167314578872 |
10 | 55150106051 |
11 | 21430884a47 |
12 | a8317aa76b |
13 | 527ba36861 |
14 | 2952707215 |
15 | 167ba9c26b |
hex | cd733d5c3 |
55150106051 has 2 divisors, whose sum is σ = 55150106052. Its totient is φ = 55150106050.
The previous prime is 55150105993. The next prime is 55150106071. The reversal of 55150106051 is 15060105155.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 55150106051 - 210 = 55150105027 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (55150106071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27575053025 + 27575053026.
It is an arithmetic number, because the mean of its divisors is an integer number (27575053026).
Almost surely, 255150106051 is an apocalyptic number.
55150106051 is a deficient number, since it is larger than the sum of its proper divisors (1).
55150106051 is an equidigital number, since it uses as much as digits as its factorization.
55150106051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3750, while the sum is 29.
The spelling of 55150106051 in words is "fifty-five billion, one hundred fifty million, one hundred six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •