11150141 has 2 divisors, whose sum is σ = 11150142. Its totient is φ = 11150140.

The previous prime is 11150107. The next prime is 11150159. The reversal of 11150141 is 14105111.

11150141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10824100 + 326041 = 3290^2 + 571^2 .

It is a cyclic number.

It is not a de Polignac number, because 11150141 - 2⁶ = 11150077 is a prime.

It is a Sophie Germain prime.

It is a Chen 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 (11150171) by changing a digit.

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

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

Almost surely, 2^11150141 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 11150141 is about 3339.1826844304. The cubic root of 11150141 is about 223.4052902957.

Adding to 11150141 its reverse (14105111), we get a palindrome (25255252).

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