Base | Representation |
---|---|
bin | 1001100001001010… |
… | …10110110101010001 |
3 | 111012010111021102201 |
4 | 10300211112311101 |
5 | 40431134112023 |
6 | 2203022243201 |
7 | 240426564046 |
oct | 46045266521 |
9 | 14163437381 |
10 | 5110066513 |
11 | 2192554672 |
12 | ba7426501 |
13 | 6358b82c6 |
14 | 3669531cd |
15 | 1ed948bad |
hex | 130956d51 |
5110066513 has 2 divisors, whose sum is σ = 5110066514. Its totient is φ = 5110066512.
The previous prime is 5110066433. The next prime is 5110066531. The reversal of 5110066513 is 3156600115.
Together with next prime (5110066531) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3179606544 + 1930459969 = 56388^2 + 43937^2 .
It is a cyclic number.
It is not a de Polignac number, because 5110066513 - 29 = 5110066001 is a prime.
It is a super-2 number, since 2×51100665132 = 52225559534567958338, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5110066583) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2555033256 + 2555033257.
It is an arithmetic number, because the mean of its divisors is an integer number (2555033257).
Almost surely, 25110066513 is an apocalyptic number.
It is an amenable number.
5110066513 is a deficient number, since it is larger than the sum of its proper divisors (1).
5110066513 is an equidigital number, since it uses as much as digits as its factorization.
5110066513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700, while the sum is 28.
The square root of 5110066513 is about 71484.7292293956. The cubic root of 5110066513 is about 1722.4323924304.
Adding to 5110066513 its reverse (3156600115), we get a palindrome (8266666628).
The spelling of 5110066513 in words is "five billion, one hundred ten million, sixty-six thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •