101110110101111 has 2 divisors, whose sum is σ = 101110110101112. Its totient is φ = 101110110101110.

The previous prime is 101110110101101. The next prime is 101110110101149. The reversal of 101110110101111 is 111101011011101.

It is a weak prime.

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

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

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

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

101110110101111 is an evil number, because the sum of its binary digits is even.

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

Adding to 101110110101111 its reverse (111101011011101), we get a palindrome (212211121112212).

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