1114909929560 has 64 divisors (see below), whose sum is σ = 2913909837120. Its totient is φ = 375988354560.

The previous prime is 1114909929559. The next prime is 1114909929569. The reversal of 1114909929560 is 659299094111.

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

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1114909929569) 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 15 ways as a sum of consecutive naturals, for example, 32620799 + ... + 32654958.

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

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

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

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 1574640, while the sum is 56.

The spelling of 1114909929560 in words is "one trillion, one hundred fourteen billion, nine hundred nine million, nine hundred twenty-nine thousand, five hundred sixty".