1011210021013 has 2 divisors, whose sum is σ = 1011210021014. Its totient is φ = 1011210021012.

The previous prime is 1011210020897. The next prime is 1011210021077. The reversal of 1011210021013 is 3101200121101.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 631362143889 + 379847877124 = 794583^2 + 616318^2 .

It is an emirp because it is prime and its reverse (3101200121101) is a distict prime.

It is a cyclic number.

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

It is a super-2 number, since 2×1011210021013² (a number of 25 digits) contains 22 as substring.

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

It is a congruent number.

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12, while the sum is 13.

Adding to 1011210021013 its reverse (3101200121101), we get a palindrome (4112410142114).

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