11010010013 has 2 divisors, whose sum is σ = 11010010014. Its totient is φ = 11010010012.

The previous prime is 11010009991. The next prime is 11010010031. The reversal of 11010010013 is 31001001011.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10310777764 + 699232249 = 101542^2 + 26443^2 .

It is a cyclic number.

It is not a de Polignac number, because 11010010013 - 2⁸ = 11010009757 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2^11010010013 is an apocalyptic number.

It is an amenable number.

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

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

11010010013 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 8.

Adding to 11010010013 its reverse (31001001011), we get a palindrome (42011011024).

The spelling of 11010010013 in words is "eleven billion, ten million, ten thousand, thirteen".