111110101111111 has 2 divisors, whose sum is σ = 111110101111112. Its totient is φ = 111110101111110.

The previous prime is 111110101111103. The next prime is 111110101111199. The reversal of 111110101111111 is 111111101011111.

It is a happy number.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 111110101111111 - 2³ = 111110101111103 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2^{111110101111111} is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1, while the sum is 13.

Adding to 111110101111111 its reverse (111111101011111), we get a palindrome (222221202122222).

It can be divided in two parts, 1111101011111 and 11, that multiplied together give a palindrome (12222111122221).

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