13691691048961 has 16 divisors (see below), whose sum is σ = 14176572595920. Its totient is φ = 13214120325120.

The previous prime is 13691691048947. The next prime is 13691691049009. The reversal of 13691691048961 is 16984019619631.

It can be written as a sum of positive squares in 8 ways, for example, as 208694562561 + 13482996486400 = 456831^2 + 3671920^2 .

It is a cyclic number.

It is not a de Polignac number, because 13691691048961 - 2³⁵ = 13657331310593 is a prime.

It is a Duffinian number.

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

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

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

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

It is an amenable number.

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

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

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

The sum of its prime factors is 1541364.

The product of its (nonzero) digits is 15116544, while the sum is 64.

The spelling of 13691691048961 in words is "thirteen trillion, six hundred ninety-one billion, six hundred ninety-one million, forty-eight thousand, nine hundred sixty-one".