110010011011141 has 2 divisors, whose sum is σ = 110010011011142. Its totient is φ = 110010011011140.

The previous prime is 110010011011133. The next prime is 110010011011163. The reversal of 110010011011141 is 141110110010011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 109472883259041 + 537127752100 = 10462929^2 + 732890^2 .

It is a cyclic number.

It is not a de Polignac number, because 110010011011141 - 2³ = 110010011011133 is a prime.

It is a super-2 number, since 2×110010011011141² (a number of 29 digits) contains 22 as substring.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (110010011011441) 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 as a sum of consecutive naturals, namely, 55005005505570 + 55005005505571.

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

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

It is an amenable number.

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

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

110010011011141 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 13.

Adding to 110010011011141 its reverse (141110110010011), we get a palindrome (251120121021152).

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