10905132 has 48 divisors (see below), whose sum is σ = 29272320. Its totient is φ = 3095232.

The previous prime is 10905127. The next prime is 10905133. The reversal of 10905132 is 23150901.

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

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

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

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

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

Almost surely, 2^10905132 is an apocalyptic number.

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

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

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

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

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

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

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

The square root of 10905132 is about 3302.2919313713. The cubic root of 10905132 is about 221.7568151116.

The spelling of 10905132 in words is "ten million, nine hundred five thousand, one hundred thirty-two".