500010101111 has 2 divisors, whose sum is σ = 500010101112. Its totient is φ = 500010101110.

The previous prime is 500010101057. The next prime is 500010101119. The reversal of 500010101111 is 111101010005.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 500010101111 - 2²⁶ = 499942992247 is a prime.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 2^500010101111 is an apocalyptic number.

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

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

500010101111 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 500010101111 its reverse (111101010005), we get a palindrome (611111111116).

The spelling of 500010101111 in words is "five hundred billion, ten million, one hundred one thousand, one hundred eleven".