100000111106101 has 2 divisors, whose sum is σ = 100000111106102. Its totient is φ = 100000111106100.

The previous prime is 100000111106011. The next prime is 100000111106107. The reversal of 100000111106101 is 101601111000001.

Together with previous prime (100000111106011) 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., 93850078140625 + 6150032965476 = 9687625^2 + 2479926^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-100000111106101 is a prime.

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

100000111106101 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 13.

Adding to 100000111106101 its reverse (101601111000001), we get a palindrome (201601222106102).

The spelling of 100000111106101 in words is "one hundred trillion, one hundred eleven million, one hundred six thousand, one hundred one".