Base | Representation |
---|---|
bin | 11110100111101… |
… | …101001100101111 |
3 | 1022210122221112102 |
4 | 132213231030233 |
5 | 2023003201411 |
6 | 122550525315 |
7 | 15505410125 |
oct | 3647551457 |
9 | 1283587472 |
10 | 513725231 |
11 | 243a91408 |
12 | 12406683b |
13 | 8257c436 |
14 | 4c329915 |
15 | 30179d3b |
hex | 1e9ed32f |
513725231 has 2 divisors, whose sum is σ = 513725232. Its totient is φ = 513725230.
The previous prime is 513725209. The next prime is 513725239. The reversal of 513725231 is 132527315.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-513725231 is a prime.
It is a super-2 number, since 2×5137252312 = 527827225932006722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 513725194 and 513725203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (513725239) 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, 256862615 + 256862616.
It is an arithmetic number, because the mean of its divisors is an integer number (256862616).
Almost surely, 2513725231 is an apocalyptic number.
513725231 is a deficient number, since it is larger than the sum of its proper divisors (1).
513725231 is an equidigital number, since it uses as much as digits as its factorization.
513725231 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6300, while the sum is 29.
The square root of 513725231 is about 22665.5075169298. The cubic root of 513725231 is about 800.8975504399.
The spelling of 513725231 in words is "five hundred thirteen million, seven hundred twenty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •