10141161 has 4 divisors (see below), whose sum is σ = 13521552. Its totient is φ = 6760772.

The previous prime is 10141141. The next prime is 10141169. The reversal of 10141161 is 16114101.

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, and also an emirpimes, since its reverse is a distinct semiprime: 16114101 = 3 ⋅5371367.

It is a cyclic number.

It is not a de Polignac number, because 10141161 - 2¹⁷ = 10010089 is a prime.

It is a Curzon number.

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

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

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

Almost surely, 2^10141161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3380390.

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

The square root of 10141161 is about 3184.5189589638. The cubic root of 10141161 is about 216.4524765593.

Adding to 10141161 its reverse (16114101), we get a palindrome (26255262).

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