1010111110213 has 2 divisors, whose sum is σ = 1010111110214. Its totient is φ = 1010111110212.

The previous prime is 1010111110199. The next prime is 1010111110219. The reversal of 1010111110213 is 3120111110101.

1010111110213 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., 972704842564 + 37406267649 = 986258^2 + 193407^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-1010111110213 is a prime.

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

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

1010111110213 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 13.

Adding to 1010111110213 its reverse (3120111110101), we get a palindrome (4130222220314).

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