Base | Representation |
---|---|
bin | 11000001111101100001010… |
… | …01111111110101110011111 |
3 | 20222202221001100001220101221 |
4 | 30013312011033332232133 |
5 | 23442010440114312223 |
6 | 305220513404514211 |
7 | 14141633604510301 |
oct | 1407660517765637 |
9 | 228687040056357 |
10 | 53315664604063 |
11 | 15a96056806a34 |
12 | 5b90b2424b967 |
13 | 23998514c5b64 |
14 | d246c5c29971 |
15 | 626ce1da6b5d |
hex | 307d853feb9f |
53315664604063 has 2 divisors, whose sum is σ = 53315664604064. Its totient is φ = 53315664604062.
The previous prime is 53315664603979. The next prime is 53315664604073. The reversal of 53315664604063 is 36040646651335.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-53315664604063 is a prime.
It is a super-2 number, since 2×533156646040632 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 53315664604063.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53315664604073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26657832302031 + 26657832302032.
It is an arithmetic number, because the mean of its divisors is an integer number (26657832302032).
Almost surely, 253315664604063 is an apocalyptic number.
53315664604063 is a deficient number, since it is larger than the sum of its proper divisors (1).
53315664604063 is an equidigital number, since it uses as much as digits as its factorization.
53315664604063 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13996800, while the sum is 52.
The spelling of 53315664604063 in words is "fifty-three trillion, three hundred fifteen billion, six hundred sixty-four million, six hundred four thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •