11011001110013 has 2 divisors, whose sum is σ = 11011001110014. Its totient is φ = 11011001110012.

The previous prime is 11011001109991. The next prime is 11011001110027. The reversal of 11011001110013 is 31001110011011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9748214017369 + 1262787092644 = 3122213^2 + 1123738^2 .

It is a cyclic number.

It is not a de Polignac number, because 11011001110013 - 2¹² = 11011001105917 is a prime.

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

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

11011001110013 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 11011001110013 its reverse (31001110011011), we get a palindrome (42012111121024).

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