10914362111 has 2 divisors, whose sum is σ = 10914362112. Its totient is φ = 10914362110.

The previous prime is 10914362029. The next prime is 10914362113. The reversal of 10914362111 is 11126341901.

It is a strong prime.

It is a cyclic number.

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

It is a Sophie Germain prime.

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

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 2^10914362111 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1296, while the sum is 29.

The spelling of 10914362111 in words is "ten billion, nine hundred fourteen million, three hundred sixty-two thousand, one hundred eleven".