Base | Representation |
---|---|
bin | 110011110101000011… |
… | …101110001100110001 |
3 | 12022122102011202212021 |
4 | 303311003232030301 |
5 | 1402433124014022 |
6 | 41322110031441 |
7 | 4010040463504 |
oct | 636503561461 |
9 | 168572152767 |
10 | 55651001137 |
11 | 216685a2926 |
12 | a9514a8581 |
13 | 532b743194 |
14 | 299d05313b |
15 | 16aaa407c7 |
hex | cf50ee331 |
55651001137 has 2 divisors, whose sum is σ = 55651001138. Its totient is φ = 55651001136.
The previous prime is 55651001129. The next prime is 55651001167. The reversal of 55651001137 is 73110015655.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 51845468416 + 3805532721 = 227696^2 + 61689^2 .
It is a cyclic number.
It is not a de Polignac number, because 55651001137 - 23 = 55651001129 is a prime.
It is not a weakly prime, because it can be changed into another prime (55651001167) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27825500568 + 27825500569.
It is an arithmetic number, because the mean of its divisors is an integer number (27825500569).
Almost surely, 255651001137 is an apocalyptic number.
It is an amenable number.
55651001137 is a deficient number, since it is larger than the sum of its proper divisors (1).
55651001137 is an equidigital number, since it uses as much as digits as its factorization.
55651001137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15750, while the sum is 34.
The spelling of 55651001137 in words is "fifty-five billion, six hundred fifty-one million, one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •