5050001110013 has 2 divisors, whose sum is σ = 5050001110014. Its totient is φ = 5050001110012.

The previous prime is 5050001110001. The next prime is 5050001110031. The reversal of 5050001110013 is 3100111000505.

Together with next prime (5050001110031) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 3771468868729 + 1278532241284 = 1942027^2 + 1130722^2 .

It is a cyclic number.

It is not a de Polignac number, because 5050001110013 - 2⁸ = 5050001109757 is a prime.

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

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

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

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

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

Adding to 5050001110013 its reverse (3100111000505), we get a palindrome (8150112110518).

The spelling of 5050001110013 in words is "five trillion, fifty billion, one million, one hundred ten thousand, thirteen".