110101111111111 has 2 divisors, whose sum is σ = 110101111111112. Its totient is φ = 110101111111110.

The previous prime is 110101111111039. The next prime is 110101111111127. The reversal of 110101111111111 is 111111111101011.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 110101111111111 - 2⁴¹ = 107902087855559 is a prime.

110101111111111 is a modest number, since divided by 11111111 gives 1101011 as remainder.

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

It is a congruent number.

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

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

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

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

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

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

110101111111111 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 110101111111111 its reverse (111111111101011), we get a palindrome (221212222212122).

It can be divided in two parts, 1101011 and 11111111, that multiplied together give a palindrome (12233455433221).

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