Search a number
-
+
110111102111 is a prime number
BaseRepresentation
bin110011010001100100…
…0100001010010011111
3101112012211110112211002
41212203020201102133
53301001420231421
6122330115020515
710645440632213
oct1464310412237
9345184415732
10110111102111
114277493483a
121940bb9a73b
13a4ca529aba
145487c64943
152ce6c41b0b
hex19a322149f

110111102111 has 2 divisors, whose sum is σ = 110111102112. Its totient is φ = 110111102110.

The previous prime is 110111102099. The next prime is 110111102113. The reversal of 110111102111 is 111201111011.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 110111102111 - 218 = 110110839967 is a prime.

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

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 110111102092 and 110111102101.

It is a congruent number.

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

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

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

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

Almost surely, 2110111102111 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2, while the sum is 11.

Adding to 110111102111 its reverse (111201111011), we get a palindrome (221312213122).

The spelling of 110111102111 in words is "one hundred ten billion, one hundred eleven million, one hundred two thousand, one hundred eleven".