110200200109 has 2 divisors, whose sum is σ = 110200200110. Its totient is φ = 110200200108.

The previous prime is 110200200091. The next prime is 110200200139. The reversal of 110200200109 is 901002002011.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 106681930884 + 3518269225 = 326622^2 + 59315^2 .

It is a cyclic number.

It is not a de Polignac number, because 110200200109 - 2²⁹ = 109663329197 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 2^110200200109 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 36, while the sum is 16.

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