Base | Representation |
---|---|
bin | 10111101111011100000100… |
… | …01000011000011001101011 |
3 | 20211211222201012000210212021 |
4 | 23313232002020120121223 |
5 | 23320331440220434214 |
6 | 303011444353125311 |
7 | 13665603533056324 |
oct | 1367560210303153 |
9 | 224758635023767 |
10 | 52207510718059 |
11 | 156a9098831784 |
12 | 5a321b9859837 |
13 | 23191bb347b88 |
14 | cc6bdd87b44b |
15 | 60808565e924 |
hex | 2f7b8221866b |
52207510718059 has 2 divisors, whose sum is σ = 52207510718060. Its totient is φ = 52207510718058.
The previous prime is 52207510718021. The next prime is 52207510718081. The reversal of 52207510718059 is 95081701570225.
52207510718059 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 52207510718059 - 233 = 52198920783467 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 52207510717997 and 52207510718015.
It is not a weakly prime, because it can be changed into another prime (52207510718089) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26103755359029 + 26103755359030.
It is an arithmetic number, because the mean of its divisors is an integer number (26103755359030).
Almost surely, 252207510718059 is an apocalyptic number.
52207510718059 is a deficient number, since it is larger than the sum of its proper divisors (1).
52207510718059 is an equidigital number, since it uses as much as digits as its factorization.
52207510718059 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1764000, while the sum is 52.
The spelling of 52207510718059 in words is "fifty-two trillion, two hundred seven billion, five hundred ten million, seven hundred eighteen thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.957 sec. • engine limits •