110311040141 has 4 divisors (see below), whose sum is σ = 110324555232. Its totient is φ = 110297525052.

The previous prime is 110311040137. The next prime is 110311040167. The reversal of 110311040141 is 141040113011.

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, and also an emirpimes, since its reverse is a distinct semiprime: 141040113011 = 7 ⋅20148587573.

It is a cyclic number.

It is not a de Polignac number, because 110311040141 - 2² = 110311040137 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

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

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

Almost surely, 2^110311040141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 13515090.

The product of its (nonzero) digits is 48, while the sum is 17.

Adding to 110311040141 its reverse (141040113011), we get a palindrome (251351153152).

The spelling of 110311040141 in words is "one hundred ten billion, three hundred eleven million, forty thousand, one hundred forty-one".