1151015200 has 72 divisors (see below), whose sum is σ = 2825795700. Its totient is φ = 457804800.

The previous prime is 1151015171. The next prime is 1151015219. The reversal of 1151015200 is 25101511.

It can be written as a sum of positive squares in 6 ways, for example, as 95804944 + 1055210256 = 9788^2 + 32484^2 .

It is a Harshad number since it is a multiple of its sum of digits (16).

It is an unprimeable number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 140826 + ... + 148774.

Almost surely, 2^1151015200 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 1151015200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1412897850).

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

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

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

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

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

The product of its (nonzero) digits is 50, while the sum is 16.

The square root of 1151015200 is about 33926.6149210321. The cubic root of 1151015200 is about 1047.9977565362.

Adding to 1151015200 its reverse (25101511), we get a palindrome (1176116711).

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