1011115151 has 2 divisors, whose sum is σ = 1011115152. Its totient is φ = 1011115150.

The previous prime is 1011115129. The next prime is 1011115159. The reversal of 1011115151 is 1515111101.

It is a strong prime.

It is a cyclic number.

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

It is a congruent number.

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

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

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

Almost surely, 2^1011115151 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 25, while the sum is 17.

The square root of 1011115151 is about 31798.0369048154. The cubic root of 1011115151 is about 1003.6914070801.

Adding to 1011115151 its reverse (1515111101), we get a palindrome (2526226252).

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