11036952 has 64 divisors (see below), whose sum is σ = 31509600. Its totient is φ = 3576960.

The previous prime is 11036933. The next prime is 11036959. The reversal of 11036952 is 25963011.

It is a super-3 number, since 3×11036952³ (a number of 22 digits) contains 333 as substring.

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

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7302 + ... + 8682.

Almost surely, 2^11036952 is an apocalyptic number.

11036952 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 11036952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15754800).

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

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

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

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

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

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

The square root of 11036952 is about 3322.1908434044. The cubic root of 11036952 is about 222.6467625764.

Adding to 11036952 its reverse (25963011), we get a palindrome (36999963).

The spelling of 11036952 in words is "eleven million, thirty-six thousand, nine hundred fifty-two".