Base | Representation |
---|---|
bin | 11001010000101101111100… |
… | …000010100110101001000011 |
3 | 112120101001112000210210002212 |
4 | 121100231330002212221003 |
5 | 104030230300011243404 |
6 | 1032142345131332335 |
7 | 32254465400233406 |
oct | 3120557402465103 |
9 | 476331460723085 |
10 | 111100000102979 |
11 | 32444277761598 |
12 | 10563b112b10ab |
13 | 49cb8ba0b4564 |
14 | 1d613a9433d3d |
15 | cc9e751d406e |
hex | 650b7c0a6a43 |
111100000102979 has 2 divisors, whose sum is σ = 111100000102980. Its totient is φ = 111100000102978.
The previous prime is 111100000102943. The next prime is 111100000102999. The reversal of 111100000102979 is 979201000001111.
It is a strong prime.
It is an emirp because it is prime and its reverse (979201000001111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 111100000102979 - 240 = 110000488475203 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (111100000102939) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55550000051489 + 55550000051490.
It is an arithmetic number, because the mean of its divisors is an integer number (55550000051490).
Almost surely, 2111100000102979 is an apocalyptic number.
111100000102979 is a deficient number, since it is larger than the sum of its proper divisors (1).
111100000102979 is an equidigital number, since it uses as much as digits as its factorization.
111100000102979 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 32.
The spelling of 111100000102979 in words is "one hundred eleven trillion, one hundred billion, one hundred two thousand, nine hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •