211101001101013 has 2 divisors, whose sum is σ = 211101001101014. Its totient is φ = 211101001101012.

The previous prime is 211101001100999. The next prime is 211101001101071. The reversal of 211101001101013 is 310101100101112.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 158145136882929 + 52955864218084 = 12575577^2 + 7277078^2 .

It is a cyclic number.

It is not a de Polignac number, because 211101001101013 - 2⁴⁵ = 175916629012181 is a prime.

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

It is a congruent number.

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

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

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

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

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

It is an amenable number.

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

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

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

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

Adding to 211101001101013 its reverse (310101100101112), we get a palindrome (521202101202125).

Subtracting 211101001101013 from its reverse (310101100101112), we obtain a palindrome (99000099000099).

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