101010010101113 has 2 divisors, whose sum is σ = 101010010101114. Its totient is φ = 101010010101112.

The previous prime is 101010010101103. The next prime is 101010010101163. The reversal of 101010010101113 is 311101010010101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 99888671002624 + 1121339098489 = 9994432^2 + 1058933^2 .

It is a cyclic number.

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

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

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

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

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

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

It is an amenable number.

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

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

101010010101113 is an evil number, because the sum of its binary digits is even.

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

Adding to 101010010101113 its reverse (311101010010101), we get a palindrome (412111020111214).

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