106706056132 has 12 divisors (see below), whose sum is σ = 201099875116. Its totient is φ = 49248948960.

The previous prime is 106706056117. The next prime is 106706056159. The reversal of 106706056132 is 231650607601.

It can be written as a sum of positive squares in 2 ways, for example, as 24306057216 + 82399998916 = 155904^2 + 287054^2 .

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

It is a hoax number, since the sum of its digits (37) coincides with the sum of the digits of its distinct prime factors.

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

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

Almost surely, 2^106706056132 is an apocalyptic number.

It is an amenable number.

106706056132 is a deficient number, since it is larger than the sum of its proper divisors (94393818984).

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

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

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

The product of its (nonzero) digits is 45360, while the sum is 37.

The spelling of 106706056132 in words is "one hundred six billion, seven hundred six million, fifty-six thousand, one hundred thirty-two".