110111110102031 has 2 divisors, whose sum is σ = 110111110102032. Its totient is φ = 110111110102030.

The previous prime is 110111110102013. The next prime is 110111110102109. The reversal of 110111110102031 is 130201011111011.

Together with previous prime (110111110102013) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It is a cyclic number.

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

It is a super-2 number, since 2×110111110102031² (a number of 29 digits) contains 22 as substring.

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

It is a congruent number.

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

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

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

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

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

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

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

The product of its (nonzero) digits is 6, while the sum is 14.

Adding to 110111110102031 its reverse (130201011111011), we get a palindrome (240312121213042).

The spelling of 110111110102031 in words is "one hundred ten trillion, one hundred eleven billion, one hundred ten million, one hundred two thousand, thirty-one".