110110010100113 has 2 divisors, whose sum is σ = 110110010100114. Its totient is φ = 110110010100112.

The previous prime is 110110010100047. The next prime is 110110010100127. The reversal of 110110010100113 is 311001010011011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 110108337535504 + 1672564609 = 10493252^2 + 40897^2 .

It is a cyclic number.

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

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

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

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

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3, while the sum is 11.

Adding to 110110010100113 its reverse (311001010011011), we get a palindrome (421111020111124).

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