Base | Representation |
---|---|
bin | 110000111001111010… |
… | …000101110101010101 |
3 | 12000112120222011010222 |
4 | 300321322011311111 |
5 | 1330020322341414 |
6 | 40042343524125 |
7 | 3536163205124 |
oct | 607172056525 |
9 | 160476864128 |
10 | 52511137109 |
11 | 202a7193582 |
12 | a215a59645 |
13 | 4c4b09b482 |
14 | 278203dabb |
15 | 157507068e |
hex | c39e85d55 |
52511137109 has 2 divisors, whose sum is σ = 52511137110. Its totient is φ = 52511137108.
The previous prime is 52511137099. The next prime is 52511137117. The reversal of 52511137109 is 90173111525.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 47394596209 + 5116540900 = 217703^2 + 71530^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-52511137109 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (52511131109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26255568554 + 26255568555.
It is an arithmetic number, because the mean of its divisors is an integer number (26255568555).
Almost surely, 252511137109 is an apocalyptic number.
It is an amenable number.
52511137109 is a deficient number, since it is larger than the sum of its proper divisors (1).
52511137109 is an equidigital number, since it uses as much as digits as its factorization.
52511137109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9450, while the sum is 35.
The spelling of 52511137109 in words is "fifty-two billion, five hundred eleven million, one hundred thirty-seven thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.059 sec. • engine limits •