Base | Representation |
---|---|
bin | 110011101111111011… |
… | …1101110100010010111 |
3 | 101121211211220111222211 |
4 | 1213133313232202113 |
5 | 3310043302010403 |
6 | 123015155534251 |
7 | 11012623231045 |
oct | 1473767564227 |
9 | 347754814884 |
10 | 111130110103 |
11 | 43148060601 |
12 | 196552ba387 |
13 | a6306909cc |
14 | 554331d395 |
15 | 2d5642a06d |
hex | 19dfdee897 |
111130110103 has 2 divisors, whose sum is σ = 111130110104. Its totient is φ = 111130110102.
The previous prime is 111130109957. The next prime is 111130110107. The reversal of 111130110103 is 301011031111.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111130110103 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111130110107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55565055051 + 55565055052.
It is an arithmetic number, because the mean of its divisors is an integer number (55565055052).
Almost surely, 2111130110103 is an apocalyptic number.
111130110103 is a deficient number, since it is larger than the sum of its proper divisors (1).
111130110103 is an equidigital number, since it uses as much as digits as its factorization.
111130110103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 13.
Adding to 111130110103 its reverse (301011031111), we get a palindrome (412141141214).
The spelling of 111130110103 in words is "one hundred eleven billion, one hundred thirty million, one hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •