100000015110101 has 2 divisors, whose sum is σ = 100000015110102. Its totient is φ = 100000015110100.

The previous prime is 100000015110029. The next prime is 100000015110109. The reversal of 100000015110101 is 101011510000001.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 94070794980100 + 5929220130001 = 9699010^2 + 2434999^2 .

It is a cyclic number.

It is not a de Polignac number, because 100000015110101 - 2¹⁰ = 100000015109077 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

100000015110101 is an odious number, because the sum of its binary digits is odd.

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

Adding to 100000015110101 its reverse (101011510000001), we get a palindrome (201011525110102).

The spelling of 100000015110101 in words is "one hundred trillion, fifteen million, one hundred ten thousand, one hundred one".