Base | Representation |
---|---|
bin | 110001010111110110… |
… | …100010001001111001 |
3 | 12001211121021220022101 |
4 | 301113312202021321 |
5 | 1332032430133032 |
6 | 40204251423401 |
7 | 3554503331212 |
oct | 612766421171 |
9 | 161747256271 |
10 | 53013521017 |
11 | 20534828a96 |
12 | a336154b61 |
13 | 4ccb1a9662 |
14 | 27cca56409 |
15 | 15a4209de7 |
hex | c57da2279 |
53013521017 has 2 divisors, whose sum is σ = 53013521018. Its totient is φ = 53013521016.
The previous prime is 53013520957. The next prime is 53013521051. The reversal of 53013521017 is 71012531035.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 32675623696 + 20337897321 = 180764^2 + 142611^2 .
It is a cyclic number.
It is not a de Polignac number, because 53013521017 - 211 = 53013518969 is a prime.
It is not a weakly prime, because it can be changed into another prime (53013521087) 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, 26506760508 + 26506760509.
It is an arithmetic number, because the mean of its divisors is an integer number (26506760509).
Almost surely, 253013521017 is an apocalyptic number.
It is an amenable number.
53013521017 is a deficient number, since it is larger than the sum of its proper divisors (1).
53013521017 is an equidigital number, since it uses as much as digits as its factorization.
53013521017 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 53013521017 in words is "fifty-three billion, thirteen million, five hundred twenty-one thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •