100001111141 has 2 divisors, whose sum is σ = 100001111142. Its totient is φ = 100001111140.

The previous prime is 100001111137. The next prime is 100001111257. The reversal of 100001111141 is 141111100001.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 67949370241 + 32051740900 = 260671^2 + 179030^2 .

It is a cyclic number.

It is not a de Polignac number, because 100001111141 - 2² = 100001111137 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (100001111741) 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, 50000555570 + 50000555571.

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

Almost surely, 2^100001111141 is an apocalyptic number.

It is an amenable number.

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

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

100001111141 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 11.

Adding to 100001111141 its reverse (141111100001), we get a palindrome (241112211142).

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