10322010141 has 8 divisors (see below), whose sum is σ = 13988298144. Its totient is φ = 6768531120.

The previous prime is 10322010137. The next prime is 10322010161. The reversal of 10322010141 is 14101022301.

10322010141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 10322010141 - 2² = 10322010137 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 10322010141.

It is a congruent number.

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

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

Almost surely, 2^10322010141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 56404491.

The product of its (nonzero) digits is 48, while the sum is 15.

Adding to 10322010141 its reverse (14101022301), we get a palindrome (24423032442).

The spelling of 10322010141 in words is "ten billion, three hundred twenty-two million, ten thousand, one hundred forty-one".