10161132 has 24 divisors (see below), whose sum is σ = 23764272. Its totient is φ = 3379200.

The previous prime is 10161119. The next prime is 10161133. The reversal of 10161132 is 23116101.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7032 + ... + 8352.

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

Almost surely, 2^10161132 is an apocalyptic number.

10161132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 36, while the sum is 15.

The square root of 10161132 is about 3187.6530551489. The cubic root of 10161132 is about 216.5944700943.

Adding to 10161132 its reverse (23116101), we get a palindrome (33277233).

The spelling of 10161132 in words is "ten million, one hundred sixty-one thousand, one hundred thirty-two".