Search a number
-
+
111010201222111 is a prime number
BaseRepresentation
bin11001001111011010010011…
…100111000011101111011111
3112120001110201210100222120021
4121033122103213003233133
5104022242343003101421
61032033214333533011
732245136162315122
oct3117322347035737
9476043653328507
10111010201222111
113240a186618264
121054a62b944167
1349c32a8b4baa9
141d5accb12a3b9
15cc796b833341
hex64f6939c3bdf

111010201222111 has 2 divisors, whose sum is σ = 111010201222112. Its totient is φ = 111010201222110.

The previous prime is 111010201222079. The next prime is 111010201222127. The reversal of 111010201222111 is 111222102010111.

It is an a-pointer prime, because the next prime (111010201222127) can be obtained adding 111010201222111 to its sum of digits (16).

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 111010201222111 - 25 = 111010201222079 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (111010201223111) 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, 55505100611055 + 55505100611056.

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

Almost surely, 2111010201222111 is an apocalyptic number.

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

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

111010201222111 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 16.

Adding to 111010201222111 its reverse (111222102010111), we get a palindrome (222232303232222).

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