11111001010013 has 2 divisors, whose sum is σ = 11111001010014. Its totient is φ = 11111001010012.

The previous prime is 11111001010007. The next prime is 11111001010037. The reversal of 11111001010013 is 31001010011111.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 11104536528409 + 6464481604 = 3332347^2 + 80402^2 .

It is a cyclic number.

It is not a de Polignac number, because 11111001010013 - 2²⁰ = 11110999961437 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3, while the sum is 11.

Adding to 11111001010013 its reverse (31001010011111), we get a palindrome (42112011021124).

The spelling of 11111001010013 in words is "eleven trillion, one hundred eleven billion, one million, ten thousand, thirteen".