110200001113 has 2 divisors, whose sum is σ = 110200001114. Its totient is φ = 110200001112.

The previous prime is 110200001101. The next prime is 110200001123. The reversal of 110200001113 is 311100002011.

It is an a-pointer prime, because the next prime (110200001123) can be obtained adding 110200001113 to its sum of digits (10).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 82764385344 + 27435615769 = 287688^2 + 165637^2 .

It is a cyclic number.

It is not a de Polignac number, because 110200001113 - 2⁹ = 110200000601 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 110200001113.

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

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

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

Almost surely, 2^110200001113 is an apocalyptic number.

It is an amenable number.

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

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

110200001113 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 10.

Adding to 110200001113 its reverse (311100002011), we get a palindrome (421300003124).

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