11010010010213 has 2 divisors, whose sum is σ = 11010010010214. Its totient is φ = 11010010010212.

The previous prime is 11010010010173. The next prime is 11010010010231. The reversal of 11010010010213 is 31201001001011.

It is a happy number.

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

Together with next prime (11010010010231) 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., 10652958348769 + 357051661444 = 3263887^2 + 597538^2 .

It is a cyclic number.

It is not a de Polignac number, because 11010010010213 - 2³⁰ = 11008936268389 is a prime.

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

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

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

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

Adding to 11010010010213 its reverse (31201001001011), we get a palindrome (42211011011224).

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