5002111111 has 2 divisors, whose sum is σ = 5002111112. Its totient is φ = 5002111110.

The previous prime is 5002111091. The next prime is 5002111123. The reversal of 5002111111 is 1111112005.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 5002111111 - 2³¹ = 2854627463 is a prime.

It is a super-2 number, since 2×5002111111² = 50042231133579308642, which contains 22 as substring.

5002111111 is a modest number, since divided by 111111 gives 5002 as remainder.

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

It is a congruent number.

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

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

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

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

Almost surely, 2^5002111111 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 10, while the sum is 13.

The square root of 5002111111 is about 70725.6043523136. The cubic root of 5002111111 is about 1710.2165760822.

Adding to 5002111111 its reverse (1111112005), we get a palindrome (6113223116).

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