110607668964352 has 528 divisors, whose sum is σ = 271409168793600. Its totient is φ = 44081821679616.

The previous prime is 110607668964343. The next prime is 110607668964461. The reversal of 110607668964352 is 253469866706011.

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

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 47 ways as a sum of consecutive naturals, for example, 23048063649 + ... + 23048068447.

It is a 1-persistent number, because it is pandigital, but 2⋅110607668964352 = 221215337928704 is not.

Almost surely, 2^{110607668964352} 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 110607668964352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (135704584396800).

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

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

110607668964352 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The product of its (nonzero) digits is 78382080, while the sum is 64.

The spelling of 110607668964352 in words is "one hundred ten trillion, six hundred seven billion, six hundred sixty-eight million, nine hundred sixty-four thousand, three hundred fifty-two".