13104897674 has 8 divisors (see below), whose sum is σ = 21444378048. Its totient is φ = 5956771660.

The previous prime is 13104897613. The next prime is 13104897677. The reversal of 13104897674 is 47679840131.

13104897674 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a super-2 number, since 2×13104897674² (a number of 21 digits) contains 22 as substring.

It is a Curzon number.

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

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

Almost surely, 2^13104897674 is an apocalyptic number.

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

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

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

The sum of its prime factors is 595677180.

The product of its (nonzero) digits is 1016064, while the sum is 50.

It can be divided in two parts, 1310 and 4897674, that added together give a palindrome (4898984).

The spelling of 13104897674 in words is "thirteen billion, one hundred four million, eight hundred ninety-seven thousand, six hundred seventy-four".