10641246141 has 4 divisors (see below), whose sum is σ = 14188328192. Its totient is φ = 7094164092.

The previous prime is 10641246113. The next prime is 10641246181. The reversal of 10641246141 is 14164214601.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 10641246141 - 2⁷ = 10641246013 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10641246181) 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, 1773541021 + ... + 1773541026.

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

Almost surely, 2^10641246141 is an apocalyptic number.

It is an amenable number.

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

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

10641246141 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 3547082050.

The product of its (nonzero) digits is 4608, while the sum is 30.

The spelling of 10641246141 in words is "ten billion, six hundred forty-one million, two hundred forty-six thousand, one hundred forty-one".