101001010110113 has 2 divisors, whose sum is σ = 101001010110114. Its totient is φ = 101001010110112.

The previous prime is 101001010110109. The next prime is 101001010110149. The reversal of 101001010110113 is 311011010100101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 70651135808929 + 30349874301184 = 8405423^2 + 5509072^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 101001010110113 - 2² = 101001010110109 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3, while the sum is 11.

Adding to 101001010110113 its reverse (311011010100101), we get a palindrome (412012020210214).

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