Base | Representation |
---|---|
bin | 1001100001001100… |
… | …11110111000100111 |
3 | 111012011001021021022 |
4 | 10300212132320213 |
5 | 40431223033024 |
6 | 2203032441355 |
7 | 240432233345 |
oct | 46046367047 |
9 | 14164037238 |
10 | 5110361639 |
11 | 2192736379 |
12 | ba754925b |
13 | 63598c736 |
14 | 3669cc995 |
15 | 1ed9a635e |
hex | 13099ee27 |
5110361639 has 2 divisors, whose sum is σ = 5110361640. Its totient is φ = 5110361638.
The previous prime is 5110361611. The next prime is 5110361719. The reversal of 5110361639 is 9361630115.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5110361639 - 224 = 5093584423 is a prime.
It is a super-2 number, since 2×51103616392 = 52231592162725532642, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5110361599 and 5110361608.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5110363639) 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, 2555180819 + 2555180820.
It is an arithmetic number, because the mean of its divisors is an integer number (2555180820).
Almost surely, 25110361639 is an apocalyptic number.
5110361639 is a deficient number, since it is larger than the sum of its proper divisors (1).
5110361639 is an equidigital number, since it uses as much as digits as its factorization.
5110361639 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14580, while the sum is 35.
The square root of 5110361639 is about 71486.7934586522. The cubic root of 5110361639 is about 1722.4655508245.
The spelling of 5110361639 in words is "five billion, one hundred ten million, three hundred sixty-one thousand, six hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •