5105100011111 has 4 divisors (see below), whose sum is σ = 5373789485400. Its totient is φ = 4836410536824.

The previous prime is 5105100011083. The next prime is 5105100011159. The reversal of 5105100011111 is 1111100015015.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

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

It is a super-2 number, since 2×5105100011111² (a number of 26 digits) contains 22 as substring.

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (5105100010111) 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 in 3 ways as a sum of consecutive naturals, for example, 134344737116 + ... + 134344737153.

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

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

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

5105100011111 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 268689474288.

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

Adding to 5105100011111 its reverse (1111100015015), we get a palindrome (6216200026126).

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