110100110111111 has 2 divisors, whose sum is σ = 110100110111112. Its totient is φ = 110100110111110.

The previous prime is 110100110111003. The next prime is 110100110111119. The reversal of 110100110111111 is 111111011001011.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 110100110111111 - 2³⁸ = 109825232204167 is a prime.

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

It is a congruent number.

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

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

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

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

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

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

110100110111111 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 11.

Adding to 110100110111111 its reverse (111111011001011), we get a palindrome (221211121112122).

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