11060141 has 4 divisors (see below), whose sum is σ = 11068032. Its totient is φ = 11052252.

The previous prime is 11060129. The next prime is 11060143. The reversal of 11060141 is 14106011.

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

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 a brilliant number, because the two primes have the same length.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-11060141 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 2^11060141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 7890.

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

The square root of 11060141 is about 3325.6790284091. The cubic root of 11060141 is about 222.8025828954.

Adding to 11060141 its reverse (14106011), we get a palindrome (25166152).

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