1151515536 has 40 divisors (see below), whose sum is σ = 3149735904. Its totient is φ = 361259520.

The previous prime is 1151515513. The next prime is 1151515537. The reversal of 1151515536 is 6355151511.

It is a junction number, because it is equal to n+sod(n) for n = 1151515497 and 1151515506.

It is not an unprimeable number, because it can be changed into a prime (1151515537) 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 in 7 ways as a sum of consecutive naturals, for example, 704770 + ... + 706401.

Almost surely, 2^1151515536 is an apocalyptic number.

1151515536 is a gapful number since it is divisible by the number (16) formed by its first and last digit.

It is an amenable number.

1151515536 is an abundant number, since it is smaller than the sum of its proper divisors (1998220368).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its digits is 11250, while the sum is 33.

The square root of 1151515536 is about 33933.9879177205. The cubic root of 1151515536 is about 1048.1495862853.

The spelling of 1151515536 in words is "one billion, one hundred fifty-one million, five hundred fifteen thousand, five hundred thirty-six".