Base | Representation |
---|---|
bin | 10111101001111111110010… |
… | …10000100110100111110001 |
3 | 20211012010002020022212122001 |
4 | 23310333321100212213301 |
5 | 23304301021341114022 |
6 | 302345522452414001 |
7 | 13646234151023233 |
oct | 1364777120464761 |
9 | 224163066285561 |
10 | 52020530801137 |
11 | 15636868512718 |
12 | 5a01b16617301 |
13 | 230469060c892 |
14 | cbbb42a72253 |
15 | 6032902a7b27 |
hex | 2f4ff94269f1 |
52020530801137 has 2 divisors, whose sum is σ = 52020530801138. Its totient is φ = 52020530801136.
The previous prime is 52020530801131. The next prime is 52020530801153. The reversal of 52020530801137 is 73110803502025.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 47868354340416 + 4152176460721 = 6918696^2 + 2037689^2 .
It is a cyclic number.
It is not a de Polignac number, because 52020530801137 - 235 = 51986171062769 is a prime.
It is a super-2 number, since 2×520205308011372 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 52020530801096 and 52020530801105.
It is not a weakly prime, because it can be changed into another prime (52020530801131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26010265400568 + 26010265400569.
It is an arithmetic number, because the mean of its divisors is an integer number (26010265400569).
Almost surely, 252020530801137 is an apocalyptic number.
It is an amenable number.
52020530801137 is a deficient number, since it is larger than the sum of its proper divisors (1).
52020530801137 is an equidigital number, since it uses as much as digits as its factorization.
52020530801137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 50400, while the sum is 37.
The spelling of 52020530801137 in words is "fifty-two trillion, twenty billion, five hundred thirty million, eight hundred one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •