Search a number
-
+
12220211120111 is a prime number
BaseRepresentation
bin1011000111010011110101…
…0101111100011111101111
31121021020111112011001212222
42301310331111330133233
53100203443021320421
641553515410345555
72400611136443651
oct261647525743757
947236445131788
1012220211120111
113991620662755
121454437b8b2bb
136a8490065317
143036660206d1
15162d20914cab
hexb1d3d57c7ef

12220211120111 has 2 divisors, whose sum is σ = 12220211120112. Its totient is φ = 12220211120110.

The previous prime is 12220211120087. The next prime is 12220211120113. The reversal of 12220211120111 is 11102111202221.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 12220211120111 - 222 = 12220206925807 is a prime.

Together with 12220211120113, 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 12220211120111.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (29) of ones.

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

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

Almost surely, 212220211120111 is an apocalyptic number.

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

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

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

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

Adding to 12220211120111 its reverse (11102111202221), we get a palindrome (23322322322332).

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