Search a number
-
+
11221102112111 is a prime number
BaseRepresentation
bin1010001101001001110111…
…0011100010110101101111
31110201201121220021201122122
42203102131303202311233
52432321304120041421
635510523025103155
72235461241135143
oct243223563426557
943651556251578
1011221102112111
11363692a677291
121312884487abb
136351b755aca8
142ab16606b223
15146d474eb2ab
hexa349dce2d6f

11221102112111 has 2 divisors, whose sum is σ = 11221102112112. Its totient is φ = 11221102112110.

The previous prime is 11221102112089. The next prime is 11221102112113. The reversal of 11221102112111 is 11121120112211.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 11221102112111 - 214 = 11221102095727 is a prime.

It is a super-2 number, since 2×112211021121112 (a number of 27 digits) contains 22 as substring.

Together with 11221102112113, it forms a pair of twin primes.

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 11221102112111.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (11221102112113) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5610551056055 + 5610551056056.

It is an arithmetic number, because the mean of its divisors is an integer number (5610551056056).

Almost surely, 211221102112111 is an apocalyptic number.

11221102112111 is a deficient number, since it is larger than the sum of its proper divisors (1).

11221102112111 is an equidigital number, since it uses as much as digits as its factorization.

11221102112111 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 16, while the sum is 17.

Adding to 11221102112111 its reverse (11121120112211), we get a palindrome (22342222224322).

The spelling of 11221102112111 in words is "eleven trillion, two hundred twenty-one billion, one hundred two million, one hundred twelve thousand, one hundred eleven".