11011100110139 has 2 divisors, whose sum is σ = 11011100110140. Its totient is φ = 11011100110138.

The previous prime is 11011100110067. The next prime is 11011100110159. The reversal of 11011100110139 is 93101100111011.

It is an a-pointer prime, because the next prime (11011100110159) can be obtained adding 11011100110139 to its sum of digits (20).

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 11011100110139 - 2¹² = 11011100106043 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 11011100110139.

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

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

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

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

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

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

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

The product of its (nonzero) digits is 27, while the sum is 20.

The spelling of 11011100110139 in words is "eleven trillion, eleven billion, one hundred million, one hundred ten thousand, one hundred thirty-nine".