109475713514560 has 112 divisors (see below), whose sum is σ = 266872738182336. Its totient is φ = 42752479537152.

The previous prime is 109475713514539. The next prime is 109475713514567. The reversal of 109475713514560 is 65415317574901.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28507542 + ... + 32119018.

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

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

It is an amenable number.

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

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

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

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

109475713514560 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 15876000, while the sum is 58.

The spelling of 109475713514560 in words is "one hundred nine trillion, four hundred seventy-five billion, seven hundred thirteen million, five hundred fourteen thousand, five hundred sixty".