106249650 has 144 divisors (see below), whose sum is σ = 299522496. Its totient is φ = 24773760.

The previous prime is 106249621. The next prime is 106249651. The reversal of 106249650 is 56942601.

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

It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors.

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

It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 1031499 + ... + 1031601.

Almost surely, 2^106249650 is an apocalyptic number.

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

It is a practical number, because each smaller number is the sum of distinct divisors of 106249650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (149761248).

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

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

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

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

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

The product of its (nonzero) digits is 12960, while the sum is 33.

The square root of 106249650 is about 10307.7470865364. The cubic root of 106249650 is about 473.6335985235.

The spelling of 106249650 in words is "one hundred six million, two hundred forty-nine thousand, six hundred fifty".