1104336807050 has 24 divisors (see below), whose sum is σ = 2174893901676. Its totient is φ = 415750327040.

The previous prime is 1104336807031. The next prime is 1104336807053. The reversal of 1104336807050 is 507086334011.

It can be written as a sum of positive squares in 6 ways, for example, as 639211443049 + 465125364001 = 799507^2 + 682001^2 .

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

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 649609037 + ... + 649610736.

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

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

1104336807050 is a deficient number, since it is larger than the sum of its proper divisors (1070557094626).

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

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

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

The product of its (nonzero) digits is 60480, while the sum is 38.

The spelling of 1104336807050 in words is "one trillion, one hundred four billion, three hundred thirty-six million, eight hundred seven thousand, fifty".