10641505011 has 16 divisors (see below), whose sum is σ = 15247534464. Its totient is φ = 6577363584.

The previous prime is 10641505001. The next prime is 10641505027. The reversal of 10641505011 is 11050514601.

It is not a de Polignac number, because 10641505011 - 2¹⁰ = 10641503987 is a prime.

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

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

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

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

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

Almost surely, 2^10641505011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3114370.

The product of its (nonzero) digits is 600, while the sum is 24.

The spelling of 10641505011 in words is "ten billion, six hundred forty-one million, five hundred five thousand, eleven".