15366641401041 has 16 divisors (see below), whose sum is σ = 24171184017408. Its totient is φ = 8497681880400.

The previous prime is 15366641401003. The next prime is 15366641401049. The reversal of 15366641401041 is 14010414666351.

It is not a de Polignac number, because 15366641401041 - 2⁹ = 15366641400529 is a prime.

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

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11802335295 + ... + 11802336596.

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

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

It is an amenable number.

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

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

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

The sum of its prime factors is 23604671932.

The product of its (nonzero) digits is 207360, while the sum is 42.

The spelling of 15366641401041 in words is "fifteen trillion, three hundred sixty-six billion, six hundred forty-one million, four hundred one thousand, forty-one".