1101532152 has 64 divisors (see below), whose sum is σ = 3211488000. Its totient is φ = 314721120.

The previous prime is 1101532141. The next prime is 1101532177. The reversal of 1101532152 is 2512351011.

It is a super-2 number, since 2×1101532152² = 2426746163779502208, which contains 22 as substring.

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

It is a congruent number.

It is an unprimeable number.

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 15 ways as a sum of consecutive naturals, for example, 58674 + ... + 75137.

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

Almost surely, 2^1101532152 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 300, while the sum is 21.

The square root of 1101532152 is about 33189.3379265089. The cubic root of 1101532152 is about 1032.7591688769.

Adding to 1101532152 its reverse (2512351011), we get a palindrome (3613883163).

The spelling of 1101532152 in words is "one billion, one hundred one million, five hundred thirty-two thousand, one hundred fifty-two".