Base | Representation |
---|---|
bin | 10111111010111100000100… |
… | …11101101110011000100001 |
3 | 20220020202122100111222220202 |
4 | 23331132002131232120201 |
5 | 23343320213221214403 |
6 | 303513154134114545 |
7 | 14036262533454335 |
oct | 1375360235563041 |
9 | 226222570458822 |
10 | 52602653304353 |
11 | 15840729495289 |
12 | 5a968b61aba55 |
13 | 234754152bc09 |
14 | cdbda68977c5 |
15 | 6134b08b9688 |
hex | 2fd78276e621 |
52602653304353 has 2 divisors, whose sum is σ = 52602653304354. Its totient is φ = 52602653304352.
The previous prime is 52602653304169. The next prime is 52602653304437. The reversal of 52602653304353 is 35340335620625.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 51646888976929 + 955764327424 = 7186577^2 + 977632^2 .
It is a cyclic number.
It is not a de Polignac number, because 52602653304353 - 228 = 52602384868897 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 52602653304298 and 52602653304307.
It is not a weakly prime, because it can be changed into another prime (52602653304953) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26301326652176 + 26301326652177.
It is an arithmetic number, because the mean of its divisors is an integer number (26301326652177).
Almost surely, 252602653304353 is an apocalyptic number.
It is an amenable number.
52602653304353 is a deficient number, since it is larger than the sum of its proper divisors (1).
52602653304353 is an equidigital number, since it uses as much as digits as its factorization.
52602653304353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832000, while the sum is 47.
Adding to 52602653304353 its reverse (35340335620625), we get a palindrome (87942988924978).
The spelling of 52602653304353 in words is "fifty-two trillion, six hundred two billion, six hundred fifty-three million, three hundred four thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •