106417152 has 110 divisors (see below), whose sum is σ = 318030108. Its totient is φ = 35444736.

The previous prime is 106417151. The next prime is 106417169. The reversal of 106417152 is 251714601.

It is a happy number.

106417152 is a `hidden beast` number, since 1 + 0 + 641 + 7 + 15 + 2 = 666.

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

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

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

Almost surely, 2^106417152 is an apocalyptic number.

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

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

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

106417152 is an equidigital number, since it uses as much as digits as its factorization.

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

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

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

The square root of 106417152 is about 10315.8689406177. The cubic root of 106417152 is about 473.8823614491.

The spelling of 106417152 in words is "one hundred six million, four hundred seventeen thousand, one hundred fifty-two".