11011141 has 2 divisors, whose sum is σ = 11011142. Its totient is φ = 11011140.

The previous prime is 11011123. The next prime is 11011151. The reversal of 11011141 is 14111011.

It is an a-pointer prime, because the next prime (11011151) can be obtained adding 11011141 to its sum of digits (10).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8288641 + 2722500 = 2879^2 + 1650^2 .

It is a cyclic number.

It is not a de Polignac number, because 11011141 - 2⁵ = 11011109 is a prime.

It is a super-2 number, since 2×11011141² = 242490452243762, which contains 22 as substring.

It is a congruent number.

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

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

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

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

Almost surely, 2^11011141 is an apocalyptic number.

It is an amenable number.

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

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

11011141 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 10.

The square root of 11011141 is about 3318.3039342411. The cubic root of 11011141 is about 222.4730666385.

Adding to 11011141 its reverse (14111011), we get a palindrome (25122152).

It can be divided in two parts, 11011 and 141, that multiplied together give a palindrome (1552551).

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