11050211213 has 2 divisors, whose sum is σ = 11050211214. Its totient is φ = 11050211212.

The previous prime is 11050211141. The next prime is 11050211231. The reversal of 11050211213 is 31211205011.

11050211213 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 (11050211231) 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., 8703583849 + 2346627364 = 93293^2 + 48442^2 .

It is a cyclic number.

It is not a de Polignac number, because 11050211213 - 2¹⁶ = 11050145677 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (11050211813) 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, 5525105606 + 5525105607.

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

Almost surely, 2^11050211213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 60, while the sum is 17.

Adding to 11050211213 its reverse (31211205011), we get a palindrome (42261416224).

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