11011001110141 has 2 divisors, whose sum is σ = 11011001110142. Its totient is φ = 11011001110140.

The previous prime is 11011001110063. The next prime is 11011001110147. The reversal of 11011001110141 is 14101110011011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5871190686916 + 5139810423225 = 2423054^2 + 2267115^2 .

It is a cyclic number.

It is not a de Polignac number, because 11011001110141 - 2⁷ = 11011001110013 is a prime.

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

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

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

Adding to 11011001110141 its reverse (14101110011011), we get a palindrome (25112111121152).

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