106912770 has 32 divisors (see below), whose sum is σ = 257487552. Its totient is φ = 28410432.

The previous prime is 106912747. The next prime is 106912777. The reversal of 106912770 is 77219601.

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

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

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

Almost surely, 2^106912770 is an apocalyptic number.

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

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

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

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

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

The sum of its prime factors is 12466.

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

The square root of 106912770 is about 10339.8631518991. The cubic root of 106912770 is about 474.6168951578.

The spelling of 106912770 in words is "one hundred six million, nine hundred twelve thousand, seven hundred seventy".