Base | Representation |
---|---|
bin | 110001100000001011… |
… | …000000010101001011 |
3 | 12002012022221111211221 |
4 | 301200023000111023 |
5 | 1332324143331402 |
6 | 40230155302511 |
7 | 3561116640235 |
oct | 614013002513 |
9 | 162168844757 |
10 | 53153105227 |
11 | 205a65a6742 |
12 | a374a4aa37 |
13 | 502109c671 |
14 | 28033cd255 |
15 | 15b15cd337 |
hex | c602c054b |
53153105227 has 2 divisors, whose sum is σ = 53153105228. Its totient is φ = 53153105226.
The previous prime is 53153105191. The next prime is 53153105237. The reversal of 53153105227 is 72250135135.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 53153105227 - 27 = 53153105099 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 53153105192 and 53153105201.
It is not a weakly prime, because it can be changed into another prime (53153105237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26576552613 + 26576552614.
It is an arithmetic number, because the mean of its divisors is an integer number (26576552614).
Almost surely, 253153105227 is an apocalyptic number.
53153105227 is a deficient number, since it is larger than the sum of its proper divisors (1).
53153105227 is an equidigital number, since it uses as much as digits as its factorization.
53153105227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31500, while the sum is 34.
The spelling of 53153105227 in words is "fifty-three billion, one hundred fifty-three million, one hundred five thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •