110210201113 has 2 divisors, whose sum is σ = 110210201114. Its totient is φ = 110210201112.

The previous prime is 110210201077. The next prime is 110210201131. The reversal of 110210201113 is 311102012011.

It is a happy number.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 65194940889 + 45015260224 = 255333^2 + 212168^2 .

It is a cyclic number.

It is not a de Polignac number, because 110210201113 - 2²¹ = 110208103961 is a prime.

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

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

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

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

Almost surely, 2^110210201113 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 110210201113 its reverse (311102012011), we get a palindrome (421312213124).

The spelling of 110210201113 in words is "one hundred ten billion, two hundred ten million, two hundred one thousand, one hundred thirteen".