11011201013 has 2 divisors, whose sum is σ = 11011201014. Its totient is φ = 11011201012.

The previous prime is 11011200979. The next prime is 11011201021. The reversal of 11011201013 is 31010211011.

It is a happy number.

11011201013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10318090084 + 693110929 = 101578^2 + 26327^2 .

It is a cyclic number.

It is not a de Polignac number, because 11011201013 - 2¹⁰ = 11011199989 is a prime.

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 = 11011200985 and 11011201003.

It is a congruent number.

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

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

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

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

Almost surely, 2^11011201013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 11011201013 its reverse (31010211011), we get a palindrome (42021412024).

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