10110141 has 6 divisors (see below), whose sum is σ = 14603550. Its totient is φ = 6740088.

The previous prime is 10110137. The next prime is 10110143. The reversal of 10110141 is 14101101.

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

It can be written as a sum of positive squares in only one way, i.e., 9326916 + 783225 = 3054^2 + 885^2 .

It is not a de Polignac number, because 10110141 - 2² = 10110137 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 1123349 = 10110141 / (1 + 0 + 1 + 1 + 0 + 1 + 4 + 1).

It is a Curzon number.

It is a congruent number.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 561666 + ... + 561683.

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

Almost surely, 2^10110141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1123355 (or 1123352 counting only the distinct ones).

The product of its (nonzero) digits is 4, while the sum is 9.

The square root of 10110141 is about 3179.6447914822. The cubic root of 10110141 is about 216.2315546654.

Adding to 10110141 its reverse (14101101), we get a palindrome (24211242).

The spelling of 10110141 in words is "ten million, one hundred ten thousand, one hundred forty-one".