Base | Representation |
---|---|
bin | 110011001110010100… |
… | …011001001100101001 |
3 | 12020222010012100102101 |
4 | 303032110121030221 |
5 | 1400120232411022 |
6 | 41133411333401 |
7 | 3654656204002 |
oct | 631624311451 |
9 | 166863170371 |
10 | 55001060137 |
11 | 21364734601 |
12 | a7ab8b1261 |
13 | 5256baccca |
14 | 293a9ca1a9 |
15 | 166d95a627 |
hex | cce519329 |
55001060137 has 2 divisors, whose sum is σ = 55001060138. Its totient is φ = 55001060136.
The previous prime is 55001060117. The next prime is 55001060159. The reversal of 55001060137 is 73106010055.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 54992126016 + 8934121 = 234504^2 + 2989^2 .
It is a cyclic number.
It is not a de Polignac number, because 55001060137 - 215 = 55001027369 is a prime.
It is not a weakly prime, because it can be changed into another prime (55001060117) 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, 27500530068 + 27500530069.
It is an arithmetic number, because the mean of its divisors is an integer number (27500530069).
Almost surely, 255001060137 is an apocalyptic number.
It is an amenable number.
55001060137 is a deficient number, since it is larger than the sum of its proper divisors (1).
55001060137 is an equidigital number, since it uses as much as digits as its factorization.
55001060137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3150, while the sum is 28.
The spelling of 55001060137 in words is "fifty-five billion, one million, sixty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •