1104354215113 has 2 divisors, whose sum is σ = 1104354215114. Its totient is φ = 1104354215112.

The previous prime is 1104354215077. The next prime is 1104354215137. The reversal of 1104354215113 is 3115124534011.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 855898821904 + 248455393209 = 925148^2 + 498453^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-1104354215113 is a prime.

It is not a weakly prime, because it can be changed into another prime (1104354213113) by changing a digit.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 552177107556 + 552177107557.

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7200, while the sum is 31.

Adding to 1104354215113 its reverse (3115124534011), we get a palindrome (4219478749124).

The spelling of 1104354215113 in words is "one trillion, one hundred four billion, three hundred fifty-four million, two hundred fifteen thousand, one hundred thirteen".