110110141 has 2 divisors, whose sum is σ = 110110142. Its totient is φ = 110110140.

The previous prime is 110110127. The next prime is 110110151. The reversal of 110110141 is 141011011.

It is an a-pointer prime, because the next prime (110110151) can be obtained adding 110110141 to its sum of digits (10).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 108597241 + 1512900 = 10421^2 + 1230^2 .

It is a cyclic number.

It is not a de Polignac number, because 110110141 - 2¹³ = 110101949 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2^110110141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4, while the sum is 10.

The square root of 110110141 is about 10493.3379341371. The cubic root of 110110141 is about 479.3018510809.

Adding to 110110141 its reverse (141011011), we get a palindrome (251121152).

The spelling of 110110141 in words is "one hundred ten million, one hundred ten thousand, one hundred forty-one".