11011151 has 2 divisors, whose sum is σ = 11011152. Its totient is φ = 11011150.

The previous prime is 11011141. The next prime is 11011153. The reversal of 11011151 is 15111011.

It is a happy number.

11011151 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 is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-11011151 is a prime.

It is a Sophie Germain prime.

Together with 11011153, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 2^11011151 is an apocalyptic number.

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

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

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

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

The square root of 11011151 is about 3318.3054410346. The cubic root of 11011151 is about 222.4731339863.

Adding to 11011151 its reverse (15111011), we get a palindrome (26122162).

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

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