Base | Representation |
---|---|
bin | 1001100010011010… |
… | …01101110111010001 |
3 | 111012212011010210121 |
4 | 10301031031313101 |
5 | 40441322444122 |
6 | 2204034230241 |
7 | 240614443504 |
oct | 46115156721 |
9 | 14185133717 |
10 | 5120515537 |
11 | 2198441125 |
12 | baaa25381 |
13 | 637b06367 |
14 | 3680b313b |
15 | 1ee80ebc7 |
hex | 13134ddd1 |
5120515537 has 2 divisors, whose sum is σ = 5120515538. Its totient is φ = 5120515536.
The previous prime is 5120515501. The next prime is 5120515571. The reversal of 5120515537 is 7355150215.
It is an a-pointer prime, because the next prime (5120515571) can be obtained adding 5120515537 to its sum of digits (34).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3661581121 + 1458934416 = 60511^2 + 38196^2 .
It is a cyclic number.
It is not a de Polignac number, because 5120515537 - 215 = 5120482769 is a prime.
It is not a weakly prime, because it can be changed into another prime (5120515837) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2560257768 + 2560257769.
It is an arithmetic number, because the mean of its divisors is an integer number (2560257769).
Almost surely, 25120515537 is an apocalyptic number.
It is an amenable number.
5120515537 is a deficient number, since it is larger than the sum of its proper divisors (1).
5120515537 is an equidigital number, since it uses as much as digits as its factorization.
5120515537 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26250, while the sum is 34.
The square root of 5120515537 is about 71557.7776136179. Note that the first 3 decimals coincide. The cubic root of 5120515537 is about 1723.6055985630.
The spelling of 5120515537 in words is "five billion, one hundred twenty million, five hundred fifteen thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •