106793013642 has 64 divisors (see below), whose sum is σ = 255811987200. Its totient is φ = 29687611968.

The previous prime is 106793013611. The next prime is 106793013667. The reversal of 106793013642 is 246310397601.

106793013642 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

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

It is a Harshad number since it is a multiple of its sum of digits (42).

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

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

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

Almost surely, 2^106793013642 is an apocalyptic number.

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

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

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

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

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

The product of its (nonzero) digits is 163296, while the sum is 42.

The spelling of 106793013642 in words is "one hundred six billion, seven hundred ninety-three million, thirteen thousand, six hundred forty-two".