Search a number
-
+
112211002111111 is a prime number
BaseRepresentation
bin11001100000111000101000…
…111010111011010010000111
3112201022021012200002110201021
4121200320220322323102013
5104201431113020023421
61034353004524212011
732430656144416411
oct3140705072732207
9481267180073637
10112211002111111
11328324673a2092
12107032b169a007
134a7c5b533b1c7
141d9d081b719b1
15ce8ceb9be341
hex660e28ebb487

112211002111111 has 2 divisors, whose sum is σ = 112211002111112. Its totient is φ = 112211002111110.

The previous prime is 112211002111057. The next prime is 112211002111127. The reversal of 112211002111111 is 111111200112211.

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

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-112211002111111 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2112211002111111 is an apocalyptic number.

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

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

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

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

Adding to 112211002111111 its reverse (111111200112211), we get a palindrome (223322202223322).

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