Base | Representation |
---|---|
bin | 110001011000111111… |
… | …000110101110001001 |
3 | 12001212221002102112022 |
4 | 301120333012232021 |
5 | 1332102312421121 |
6 | 40210211254225 |
7 | 3555124124201 |
oct | 613077065611 |
9 | 161787072468 |
10 | 53032545161 |
11 | 20544542122 |
12 | a3405aa375 |
13 | 500210a84b |
14 | 27d13a9401 |
15 | 15a5c16aab |
hex | c58fc6b89 |
53032545161 has 2 divisors, whose sum is σ = 53032545162. Its totient is φ = 53032545160.
The previous prime is 53032545017. The next prime is 53032545179. The reversal of 53032545161 is 16154523035.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 31668337936 + 21364207225 = 177956^2 + 146165^2 .
It is a cyclic number.
It is not a de Polignac number, because 53032545161 - 210 = 53032544137 is a prime.
It is not a weakly prime, because it can be changed into another prime (53032545361) 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, 26516272580 + 26516272581.
It is an arithmetic number, because the mean of its divisors is an integer number (26516272581).
Almost surely, 253032545161 is an apocalyptic number.
It is an amenable number.
53032545161 is a deficient number, since it is larger than the sum of its proper divisors (1).
53032545161 is an equidigital number, since it uses as much as digits as its factorization.
53032545161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54000, while the sum is 35.
The spelling of 53032545161 in words is "fifty-three billion, thirty-two million, five hundred forty-five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •