115106111 has 2 divisors, whose sum is σ = 115106112. Its totient is φ = 115106110.

The previous prime is 115106107. The next prime is 115106113. The reversal of 115106111 is 111601511.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 115106111 - 2² = 115106107 is a prime.

It is a Sophie Germain prime.

Together with 115106113, it forms a pair of twin primes.

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 115106111.

It is a congruent number.

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

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

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

Almost surely, 2^115106111 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 30, while the sum is 17.

The square root of 115106111 is about 10728.7516049166. The cubic root of 115106111 is about 486.4439357869.

Adding to 115106111 its reverse (111601511), we get a palindrome (226707622).

The spelling of 115106111 in words is "one hundred fifteen million, one hundred six thousand, one hundred eleven".