110101001110013 has 2 divisors, whose sum is σ = 110101001110014. Its totient is φ = 110101001110012.

The previous prime is 110101001109889. The next prime is 110101001110019. The reversal of 110101001110013 is 310011100101011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 64503353834404 + 45597647275609 = 8031398^2 + 6752603^2 .

It is a cyclic number.

It is not a de Polignac number, because 110101001110013 - 2¹² = 110101001105917 is a prime.

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

It is a congruent number.

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

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

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

It is an amenable number.

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

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

110101001110013 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 110101001110013 its reverse (310011100101011), we get a palindrome (420112101211024).

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