Base | Representation |
---|---|
bin | 1010000110110100001110… |
… | …1100011010111111010111 |
3 | 1110100022120110001212100212 |
4 | 2201231003230122333113 |
5 | 2424030304311104421 |
6 | 35344514232200035 |
7 | 2224555034333051 |
oct | 241550354327727 |
9 | 43308513055325 |
10 | 11112216113111 |
11 | 35a4734334663 |
12 | 12b575683901b |
13 | 627b53aa4799 |
14 | 2a5b96bcc8d1 |
15 | 1440c3102e5b |
hex | a1b43b1afd7 |
11112216113111 has 2 divisors, whose sum is σ = 11112216113112. Its totient is φ = 11112216113110.
The previous prime is 11112216113081. The next prime is 11112216113183. The reversal of 11112216113111 is 11131161221111.
It is a m-pointer prime, because the next prime (11112216113183) can be obtained adding 11112216113111 to its product of digits (72).
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11112216113111 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11112216113191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5556108056555 + 5556108056556.
It is an arithmetic number, because the mean of its divisors is an integer number (5556108056556).
Almost surely, 211112216113111 is an apocalyptic number.
11112216113111 is a deficient number, since it is larger than the sum of its proper divisors (1).
11112216113111 is an equidigital number, since it uses as much as digits as its factorization.
11112216113111 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 72, while the sum is 23.
Adding to 11112216113111 its reverse (11131161221111), we get a palindrome (22243377334222).
The spelling of 11112216113111 in words is "eleven trillion, one hundred twelve billion, two hundred sixteen million, one hundred thirteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •