10906906050 has 144 divisors (see below), whose sum is σ = 29768094720. Its totient is φ = 2862760320.

The previous prime is 10906906039. The next prime is 10906906051. The reversal of 10906906050 is 5060960901.

It is a Curzon number.

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

It is not an unprimeable number, because it can be changed into a prime (10906906051) 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, 7943164 + ... + 7944536.

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

Almost surely, 2^10906906050 is an apocalyptic number.

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

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

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

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

10906906050 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 14580, while the sum is 36.

The spelling of 10906906050 in words is "ten billion, nine hundred six million, nine hundred six thousand, fifty".