101110110100013 has 4 divisors (see below), whose sum is σ = 115554411542880. Its totient is φ = 86665808657148.

The previous prime is 101110110099991. The next prime is 101110110100073. The reversal of 101110110100013 is 310001011011101.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

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

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (101110110100073) 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 in 3 ways as a sum of consecutive naturals, for example, 7222150721423 + ... + 7222150721436.

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

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

It is an amenable number.

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

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

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

The sum of its prime factors is 14444301442866.

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

Adding to 101110110100013 its reverse (310001011011101), we get a palindrome (411111121111114).

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