Base | Representation |
---|---|
bin | 11000001100011000110000… |
… | …00111011100100001000101 |
3 | 20222101002002022121020122101 |
4 | 30012030120013130201011 |
5 | 23433131013103004144 |
6 | 305052423103432101 |
7 | 14130505142526361 |
oct | 1406143007344105 |
9 | 228332068536571 |
10 | 53202164500549 |
11 | 15a51a02979299 |
12 | 5b72b292b5631 |
13 | 238bc33b244ac |
14 | d1cdd9c5c2a1 |
15 | 623d9c8816d4 |
hex | 3063181dc845 |
53202164500549 has 2 divisors, whose sum is σ = 53202164500550. Its totient is φ = 53202164500548.
The previous prime is 53202164500547. The next prime is 53202164500651. The reversal of 53202164500549 is 94500546120235.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 48657670005025 + 4544494495524 = 6975505^2 + 2131782^2 .
It is a cyclic number.
It is not a de Polignac number, because 53202164500549 - 21 = 53202164500547 is a prime.
Together with 53202164500547, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 53202164500499 and 53202164500508.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53202164500547) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26601082250274 + 26601082250275.
It is an arithmetic number, because the mean of its divisors is an integer number (26601082250275).
Almost surely, 253202164500549 is an apocalyptic number.
It is an amenable number.
53202164500549 is a deficient number, since it is larger than the sum of its proper divisors (1).
53202164500549 is an equidigital number, since it uses as much as digits as its factorization.
53202164500549 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296000, while the sum is 46.
The spelling of 53202164500549 in words is "fifty-three trillion, two hundred two billion, one hundred sixty-four million, five hundred thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •