11210141 has 2 divisors, whose sum is σ = 11210142. Its totient is φ = 11210140.

The previous prime is 11210117. The next prime is 11210159. The reversal of 11210141 is 14101211.

11210141 is digitally balanced in base 3, 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., 6522916 + 4687225 = 2554^2 + 2165^2 .

It is a cyclic number.

It is not a de Polignac number, because 11210141 - 2⁶ = 11210077 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (11210041) 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 as a sum of consecutive naturals, namely, 5605070 + 5605071.

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

Almost surely, 2^11210141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 8, while the sum is 11.

The square root of 11210141 is about 3348.1548649965. The cubic root of 11210141 is about 223.8052955728.

Adding to 11210141 its reverse (14101211), we get a palindrome (25311352).

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