Base | Representation |
---|---|
bin | 110011101100010110… |
… | …1111101101010100111 |
3 | 101121112111002212221222 |
4 | 1213120231331222213 |
5 | 3304322042010434 |
6 | 122555231530555 |
7 | 11006635236626 |
oct | 1473055755247 |
9 | 347474085858 |
10 | 111010110119 |
11 | 43096349867 |
12 | 19621089a5b |
13 | a611866abc |
14 | 55314036bd |
15 | 2d4ab2472e |
hex | 19d8b7daa7 |
111010110119 has 2 divisors, whose sum is σ = 111010110120. Its totient is φ = 111010110118.
The previous prime is 111010110097. The next prime is 111010110137. The reversal of 111010110119 is 911011010111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 111010110119 - 220 = 111009061543 is a prime.
It is a super-2 number, since 2×1110101101192 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 111010110097 and 111010110106.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111010110149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55505055059 + 55505055060.
It is an arithmetic number, because the mean of its divisors is an integer number (55505055060).
Almost surely, 2111010110119 is an apocalyptic number.
111010110119 is a deficient number, since it is larger than the sum of its proper divisors (1).
111010110119 is an equidigital number, since it uses as much as digits as its factorization.
111010110119 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 17.
The spelling of 111010110119 in words is "one hundred eleven billion, ten million, one hundred ten thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •