16905132 has 48 divisors (see below), whose sum is σ = 44151520. Its totient is φ = 5593536.

The previous prime is 16905127. The next prime is 16905143. The reversal of 16905132 is 23150961.

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

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

It is an unprimeable number.

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

Almost surely, 2^16905132 is an apocalyptic number.

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

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

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

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

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

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

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

The square root of 16905132 is about 4111.5850957994. The cubic root of 16905132 is about 256.6489678769.

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