101111001111143 has 2 divisors, whose sum is σ = 101111001111144. Its totient is φ = 101111001111142.

The previous prime is 101111001111101. The next prime is 101111001111167. The reversal of 101111001111143 is 341111100111101.

It is a strong prime.

It is a cyclic number.

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

It is a congruent number.

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

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

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

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

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

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

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

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

The product of its (nonzero) digits is 12, while the sum is 17.

Adding to 101111001111143 its reverse (341111100111101), we get a palindrome (442222101222244).

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