106909050 has 48 divisors (see below), whose sum is σ = 267652512. Its totient is φ = 28238400.

The previous prime is 106909043. The next prime is 106909079. The reversal of 106909050 is 50909601.

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

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

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12720 + ... + 19380.

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

Almost surely, 2^106909050 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 2430, while the sum is 30.

The square root of 106909050 is about 10339.6832640077. The cubic root of 106909050 is about 474.6113903732.

The spelling of 106909050 in words is "one hundred six million, nine hundred nine thousand, fifty".