101201121013 has 2 divisors, whose sum is σ = 101201121014. Its totient is φ = 101201121012.

The previous prime is 101201120941. The next prime is 101201121103. The reversal of 101201121013 is 310121102101.

It is a happy number.

Together with next prime (101201121103) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 77561136004 + 23639985009 = 278498^2 + 153753^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

Almost surely, 2^101201121013 is an apocalyptic number.

It is an amenable number.

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

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

101201121013 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 101201121013 its reverse (310121102101), we get a palindrome (411322223114).

The spelling of 101201121013 in words is "one hundred one billion, two hundred one million, one hundred twenty-one thousand, thirteen".