106829627814 has 288 divisors, whose sum is σ = 305689247136. Its totient is φ = 27708065280.

The previous prime is 106829627813. The next prime is 106829627873. The reversal of 106829627814 is 418726928601.

It is a happy number.

106829627814 is a `hidden beast` number, since 1 + 0 + 6 + 8 + 2 + 9 + 627 + 8 + 1 + 4 = 666.

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

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

It is a Curzon number.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 18881674 + ... + 18887330.

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

Almost surely, 2^106829627814 is an apocalyptic number.

106829627814 is a gapful number since it is divisible by the number (14) formed by its first and last digit.

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

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

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

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

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

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

The product of its (nonzero) digits is 2322432, while the sum is 54.

The spelling of 106829627814 in words is "one hundred six billion, eight hundred twenty-nine million, six hundred twenty-seven thousand, eight hundred fourteen".