110001100101107 has 2 divisors, whose sum is σ = 110001100101108. Its totient is φ = 110001100101106.

The previous prime is 110001100101071. The next prime is 110001100101121. The reversal of 110001100101107 is 701101001100011.

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

It is an a-pointer prime, because the next prime (110001100101121) can be obtained adding 110001100101107 to its sum of digits (14).

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 110001100101107 - 2⁸ = 110001100100851 is a prime.

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

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

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

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

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

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

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

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

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

Adding to 110001100101107 its reverse (701101001100011), we get a palindrome (811102101201118).

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