110110131013 has 4 divisors (see below), whose sum is σ = 111976404480. Its totient is φ = 108243857548.

The previous prime is 110110130971. The next prime is 110110131049. The reversal of 110110131013 is 310131011011.

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 cyclic number.

It is not a de Polignac number, because 110110131013 - 2¹⁷ = 110109999941 is a prime.

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (110110131113) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 933136645 + ... + 933136762.

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

Almost surely, 2^110110131013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1866273466.

The product of its (nonzero) digits is 9, while the sum is 13.

Adding to 110110131013 its reverse (310131011011), we get a palindrome (420241142024).

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