200011010112013 has 2 divisors, whose sum is σ = 200011010112014. Its totient is φ = 200011010112012.

The previous prime is 200011010111989. The next prime is 200011010112031. The reversal of 200011010112013 is 310211010110002.

It is a happy number.

Together with next prime (200011010112031) 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., 191480889626244 + 8530120485769 = 13837662^2 + 2920637^2 .

It is a cyclic number.

It is not a de Polignac number, because 200011010112013 - 2²⁹ = 200010473241101 is a prime.

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

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

200011010112013 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 200011010112013 its reverse (310211010110002), we get a palindrome (510222020222015).

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