Search a number
-
+
112221101014111 is a prime number
BaseRepresentation
bin11001100001000010000010…
…110111001011110001011111
3112201100020021110221220020201
4121201002002313023301133
5104202112303324422421
61034401355002524331
732431464332604325
oct3141020267136137
9481306243856221
10112221101014111
1132836779a19411
121070524b8066a7
134a80534676a5b
141d9d75d0bbd15
15ce91dd3b6b91
hex661082dcbc5f

112221101014111 has 2 divisors, whose sum is σ = 112221101014112. Its totient is φ = 112221101014110.

The previous prime is 112221101014063. The next prime is 112221101014123. The reversal of 112221101014111 is 111410101122211.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 112221101014111 - 213 = 112221101005919 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2112221101014111 is an apocalyptic number.

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

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

112221101014111 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 19.

Adding to 112221101014111 its reverse (111410101122211), we get a palindrome (223631202136322).

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