1101001111139 has 2 divisors, whose sum is σ = 1101001111140. Its totient is φ = 1101001111138.

The previous prime is 1101001111061. The next prime is 1101001111141. The reversal of 1101001111139 is 9311111001011.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-1101001111139 is a prime.

Together with 1101001111141, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

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

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

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

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

1101001111139 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 1101001111139 in words is "one trillion, one hundred one billion, one million, one hundred eleven thousand, one hundred thirty-nine".