Base | Representation |
---|---|
bin | 10111101001100101001000… |
… | …10101010011111101001101 |
3 | 20211010202010222001020000202 |
4 | 23310302210111103331031 |
5 | 23304032220043221112 |
6 | 302335154513303245 |
7 | 13645216432226024 |
oct | 1364624425237515 |
9 | 224122128036022 |
10 | 52006221070157 |
11 | 15630794aa3a72 |
12 | 59bb1a2264b25 |
13 | 230321caa6943 |
14 | cbb1863b18bb |
15 | 602c03d926c2 |
hex | 2f4ca4553f4d |
52006221070157 has 2 divisors, whose sum is σ = 52006221070158. Its totient is φ = 52006221070156.
The previous prime is 52006221070127. The next prime is 52006221070159. The reversal of 52006221070157 is 75107012260025.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30772381965796 + 21233839104361 = 5547286^2 + 4608019^2 .
It is a cyclic number.
It is not a de Polignac number, because 52006221070157 - 212 = 52006221066061 is a prime.
Together with 52006221070159, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 52006221070157.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (52006221070159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26003110535078 + 26003110535079.
It is an arithmetic number, because the mean of its divisors is an integer number (26003110535079).
Almost surely, 252006221070157 is an apocalyptic number.
It is an amenable number.
52006221070157 is a deficient number, since it is larger than the sum of its proper divisors (1).
52006221070157 is an equidigital number, since it uses as much as digits as its factorization.
52006221070157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 58800, while the sum is 38.
The spelling of 52006221070157 in words is "fifty-two trillion, six billion, two hundred twenty-one million, seventy thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •