Base | Representation |
---|---|
bin | 1001100001010100… |
… | …10010110001110011 |
3 | 111012012221000121212 |
4 | 10300222102301303 |
5 | 40432002020002 |
6 | 2203110110335 |
7 | 240443564012 |
oct | 46052226163 |
9 | 14165830555 |
10 | 5111360627 |
11 | 219325898a |
12 | ba794b3ab |
13 | 635c4c359 |
14 | 366baca79 |
15 | 1edb02352 |
hex | 130a92c73 |
5111360627 has 2 divisors, whose sum is σ = 5111360628. Its totient is φ = 5111360626.
The previous prime is 5111360473. The next prime is 5111360659. The reversal of 5111360627 is 7260631115.
It is an a-pointer prime, because the next prime (5111360659) can be obtained adding 5111360627 to its sum of digits (32).
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5111360627 is a prime.
It is a super-2 number, since 2×51113606272 = 52252014918491666258, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5111360593 and 5111360602.
It is not a weakly prime, because it can be changed into another prime (5111360687) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2555680313 + 2555680314.
It is an arithmetic number, because the mean of its divisors is an integer number (2555680314).
Almost surely, 25111360627 is an apocalyptic number.
5111360627 is a deficient number, since it is larger than the sum of its proper divisors (1).
5111360627 is an equidigital number, since it uses as much as digits as its factorization.
5111360627 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 32.
The square root of 5111360627 is about 71493.7803378727. The cubic root of 5111360627 is about 1722.5777809969.
The spelling of 5111360627 in words is "five billion, one hundred eleven million, three hundred sixty thousand, six hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •