106715232 has 120 divisors (see below), whose sum is σ = 338095296. Its totient is φ = 32825088.

The previous prime is 106715227. The next prime is 106715233. The reversal of 106715232 is 232517601.

It is a happy number.

It is a super-2 number, since 2×106715232² = 22776281481627648, which contains 22 as substring.

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 = 106715196 and 106715205.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (106715233) 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 19 ways as a sum of consecutive naturals, for example, 32113 + ... + 35279.

Almost surely, 2^106715232 is an apocalyptic number.

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

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

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

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

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

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

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

The square root of 106715232 is about 10330.3064814167. The cubic root of 106715232 is about 474.3244053900.

The spelling of 106715232 in words is "one hundred six million, seven hundred fifteen thousand, two hundred thirty-two".