Base | Representation |
---|---|
bin | 10100101100011100… |
… | …11110110010010111 |
3 | 1001200022000101101012 |
4 | 22112032132302113 |
5 | 140223220004421 |
6 | 5034244322435 |
7 | 542216050262 |
oct | 122616366227 |
9 | 31608011335 |
10 | 11110313111 |
11 | 4791533757 |
12 | 21a09a341b |
13 | 1080a3c391 |
14 | 7757c7cd9 |
15 | 4505ce95b |
hex | 29639ec97 |
11110313111 has 2 divisors, whose sum is σ = 11110313112. Its totient is φ = 11110313110.
The previous prime is 11110313101. The next prime is 11110313113. The reversal of 11110313111 is 11131301111.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11110313111 is a prime.
It is a super-3 number, since 3×111103131113 (a number of 31 digits) contains 333 as substring.
It is a Sophie Germain prime.
Together with 11110313113, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11110313113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555156555 + 5555156556.
It is an arithmetic number, because the mean of its divisors is an integer number (5555156556).
Almost surely, 211110313111 is an apocalyptic number.
11110313111 is a deficient number, since it is larger than the sum of its proper divisors (1).
11110313111 is an equidigital number, since it uses as much as digits as its factorization.
11110313111 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 14.
Adding to 11110313111 its reverse (11131301111), we get a palindrome (22241614222).
The spelling of 11110313111 in words is "eleven billion, one hundred ten million, three hundred thirteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •