100011141 has 12 divisors (see below), whose sum is σ = 144706432. Its totient is φ = 66560616.

The previous prime is 100011137. The next prime is 100011161. The reversal of 100011141 is 141110001.

It is not a de Polignac number, because 100011141 - 2² = 100011137 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (100011161) by changing a digit.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3691 + ... + 14616.

Almost surely, 2^100011141 is an apocalyptic number.

It is an amenable number.

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

100011141 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 18920 (or 18917 counting only the distinct ones).

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

The square root of 100011141 is about 10000.5570344856. The cubic root of 100011141 is about 464.1761200349.

Adding to 100011141 its reverse (141110001), we get a palindrome (241121142).

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