201002101101013 has 4 divisors (see below), whose sum is σ = 201002436416620. Its totient is φ = 201001765785408.

The previous prime is 201002101101001. The next prime is 201002101101049. The reversal of 201002101101013 is 310101101200102.

It is a happy number.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 147046715143524 + 53955385957489 = 12126282^2 + 7345433^2 .

It is a cyclic number.

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

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (201002101161013) by changing a digit.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 166757028 + ... + 167958061.

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

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

It is an amenable number.

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

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

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

The sum of its prime factors is 335315606.

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

Adding to 201002101101013 its reverse (310101101200102), we get a palindrome (511103202301115).

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