Base | Representation |
---|---|
bin | 100101110101011101101… |
… | …0100011101010101011101 |
3 | 200102010020122101010101012 |
4 | 1023222323110131111131 |
5 | 1140144202100134324 |
6 | 15020512121225005 |
7 | 1044456110212622 |
oct | 113527324352535 |
9 | 20363218333335 |
10 | 5200053130589 |
11 | 172536a477539 |
12 | 6bb97b332165 |
13 | 2b94943c6755 |
14 | 13d980938349 |
15 | 903ea68d20e |
hex | 4babb51d55d |
5200053130589 has 2 divisors, whose sum is σ = 5200053130590. Its totient is φ = 5200053130588.
The previous prime is 5200053130507. The next prime is 5200053130609. The reversal of 5200053130589 is 9850313500025.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4832338234564 + 367714896025 = 2198258^2 + 606395^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5200053130589 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 (5200053030589) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2600026565294 + 2600026565295.
It is an arithmetic number, because the mean of its divisors is an integer number (2600026565295).
Almost surely, 25200053130589 is an apocalyptic number.
It is an amenable number.
5200053130589 is a deficient number, since it is larger than the sum of its proper divisors (1).
5200053130589 is an equidigital number, since it uses as much as digits as its factorization.
5200053130589 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162000, while the sum is 41.
The spelling of 5200053130589 in words is "five trillion, two hundred billion, fifty-three million, one hundred thirty thousand, five hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •