106706430138 has 128 divisors (see below), whose sum is σ = 292254842880. Its totient is φ = 25115555520.

The previous prime is 106706430113. The next prime is 106706430139. The reversal of 106706430138 is 831034607601.

It is a super-2 number, since 2×106706430138² (a number of 23 digits) contains 22 as substring.

It is a Curzon number.

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

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 62370 + ... + 466157.

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

Almost surely, 2^106706430138 is an apocalyptic number.

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

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

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

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

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

The sum of its prime factors is 528592.

The product of its (nonzero) digits is 72576, while the sum is 39.

The spelling of 106706430138 in words is "one hundred six billion, seven hundred six million, four hundred thirty thousand, one hundred thirty-eight".