10641632151511 has 4 divisors (see below), whose sum is σ = 10889111969032. Its totient is φ = 10394152333992.

The previous prime is 10641632151463. The next prime is 10641632151533. The reversal of 10641632151511 is 11515123614601.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 10641632151511 - 2⁷ = 10641632151383 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 123739908696 + ... + 123739908781.

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

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

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

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

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

The sum of its prime factors is 247479817520.

The product of its (nonzero) digits is 21600, while the sum is 37.

The spelling of 10641632151511 in words is "ten trillion, six hundred forty-one billion, six hundred thirty-two million, one hundred fifty-one thousand, five hundred eleven".