106950064 has 40 divisors (see below), whose sum is σ = 223860672. Its totient is φ = 49205760.

The previous prime is 106950061. The next prime is 106950071. The reversal of 106950064 is 460059601.

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

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

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 7 ways as a sum of consecutive naturals, for example, 89052 + ... + 90244.

Almost surely, 2^106950064 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 6480, while the sum is 31.

The square root of 106950064 is about 10341.6664034381. Note that the first 3 decimals coincide. The cubic root of 106950064 is about 474.6720750481.

The spelling of 106950064 in words is "one hundred six million, nine hundred fifty thousand, sixty-four".