Base | Representation |
---|---|
bin | 1101001111101… |
… | …00111110101001 |
3 | 21202001122220202 |
4 | 12213310332221 |
5 | 211420311123 |
6 | 15005201545 |
7 | 2516240054 |
oct | 647647651 |
9 | 252048822 |
10 | 111103913 |
11 | 57796018 |
12 | 312602b5 |
13 | 1a03097b |
14 | 10a81a9b |
15 | 9b49a28 |
hex | 69f4fa9 |
111103913 has 2 divisors, whose sum is σ = 111103914. Its totient is φ = 111103912.
The previous prime is 111103879. The next prime is 111103921. The reversal of 111103913 is 319301111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 107910544 + 3193369 = 10388^2 + 1787^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111103913 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (111103943) 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, 55551956 + 55551957.
It is an arithmetic number, because the mean of its divisors is an integer number (55551957).
Almost surely, 2111103913 is an apocalyptic number.
It is an amenable number.
111103913 is a deficient number, since it is larger than the sum of its proper divisors (1).
111103913 is an equidigital number, since it uses as much as digits as its factorization.
111103913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 20.
The square root of 111103913 is about 10540.5840919752. The cubic root of 111103913 is about 480.7394750723.
The spelling of 111103913 in words is "one hundred eleven million, one hundred three thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •