101110101013 has 2 divisors, whose sum is σ = 101110101014. Its totient is φ = 101110101012.

The previous prime is 101110101007. The next prime is 101110101031. The reversal of 101110101013 is 310101011101.

Together with next prime (101110101031) 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., 69684384484 + 31425716529 = 263978^2 + 177273^2 .

It is a cyclic number.

It is not a de Polignac number, because 101110101013 - 2⁹ = 101110100501 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2^101110101013 is an apocalyptic number.

It is an amenable number.

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

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

101110101013 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 10.

Adding to 101110101013 its reverse (310101011101), we get a palindrome (411211112114).

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