10641503232 has 132 divisors (see below), whose sum is σ = 30803190496. Its totient is φ = 3538391040.

The previous prime is 10641503231. The next prime is 10641503233. The reversal of 10641503232 is 23230514601.

10641503232 is a `hidden beast` number, since 10 + 6 + 415 + 0 + 3 + 232 = 666.

It is an interprime number because it is at equal distance from previous prime (10641503231) and next prime (10641503233).

It is a super-2 number, since 2×10641503232² (a number of 21 digits) contains 22 as substring.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10641503231) 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, 4487007 + ... + 4489377.

Almost surely, 2^10641503232 is an apocalyptic number.

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

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

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

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

10641503232 is an evil number, because the sum of its binary digits is even.

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

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

The spelling of 10641503232 in words is "ten billion, six hundred forty-one million, five hundred three thousand, two hundred thirty-two".