1105051152 has 60 divisors (see below), whose sum is σ = 2922882864. Its totient is φ = 359755200.

The previous prime is 1105051111. The next prime is 1105051159. The reversal of 1105051152 is 2511505011.

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

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

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

Almost surely, 2^1105051152 is an apocalyptic number.

1105051152 is a gapful number since it is divisible by the number (12) 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 1105051152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1461441432).

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

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

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

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

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

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

The square root of 1105051152 is about 33242.3096670493. The cubic root of 1105051152 is about 1033.8577648310.

Adding to 1105051152 its reverse (2511505011), we get a palindrome (3616556163).

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