11156015151 has 48 divisors (see below), whose sum is σ = 17402711040. Its totient is φ = 6868255680.

The previous prime is 11156015113. The next prime is 11156015207. The reversal of 11156015151 is 15151065111.

11156015151 is a `hidden beast` number, since 1 + 1 + 1 + 5 + 601 + 5 + 1 + 51 = 666.

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

It is not a de Polignac number, because 11156015151 - 2²⁵ = 11122460719 is a prime.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11156015251) by changing a digit.

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

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 997770 + ... + 1008888.

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

Almost surely, 2^11156015151 is an apocalyptic number.

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

11156015151 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 11316 (or 11313 counting only the distinct ones).

The product of its (nonzero) digits is 750, while the sum is 27.

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