Base | Representation |
---|---|
bin | 1001100001001010… |
… | …01000000100101101 |
3 | 111012010101012111202 |
4 | 10300211020010231 |
5 | 40431130143221 |
6 | 2203021055245 |
7 | 240426222566 |
oct | 46045100455 |
9 | 14163335452 |
10 | 5110006061 |
11 | 2192513206 |
12 | ba73b7525 |
13 | 635896934 |
14 | 36693916d |
15 | 1ed935d0b |
hex | 13094812d |
5110006061 has 2 divisors, whose sum is σ = 5110006062. Its totient is φ = 5110006060.
The previous prime is 5110006043. The next prime is 5110006063. The reversal of 5110006061 is 1606000115.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4585321225 + 524684836 = 67715^2 + 22906^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5110006061 is a prime.
It is a super-2 number, since 2×51100060612 = 52224323886913471442, which contains 22 as substring.
Together with 5110006063, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5110006063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2555003030 + 2555003031.
It is an arithmetic number, because the mean of its divisors is an integer number (2555003031).
Almost surely, 25110006061 is an apocalyptic number.
It is an amenable number.
5110006061 is a deficient number, since it is larger than the sum of its proper divisors (1).
5110006061 is an equidigital number, since it uses as much as digits as its factorization.
5110006061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 180, while the sum is 20.
The square root of 5110006061 is about 71484.3063965791. The cubic root of 5110006061 is about 1722.4256002884.
Adding to 5110006061 its reverse (1606000115), we get a palindrome (6716006176).
The spelling of 5110006061 in words is "five billion, one hundred ten million, six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •