10117755608064 has 2112 divisors, whose sum is σ = 35304638476800. Its totient is φ = 2547020464128.

The previous prime is 10117755608029. The next prime is 10117755608071. The reversal of 10117755608064 is 46080655771101.

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

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

It is a congruent number.

It is an unprimeable number.

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 191 ways as a sum of consecutive naturals, for example, 235296642027 + ... + 235296642069.

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

Almost surely, 2^{10117755608064} is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 1411200, while the sum is 51.

The spelling of 10117755608064 in words is "ten trillion, one hundred seventeen billion, seven hundred fifty-five million, six hundred eight thousand, sixty-four".