11065141 has 4 divisors (see below), whose sum is σ = 11080300. Its totient is φ = 11049984.

The previous prime is 11065133. The next prime is 11065157. The reversal of 11065141 is 14156011.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 14156011 = 103 ⋅137437.

It can be written as a sum of positive squares in 2 ways, for example, as 3721041 + 7344100 = 1929^2 + 2710^2 .

It is a cyclic number.

It is not a de Polignac number, because 11065141 - 2³ = 11065133 is a prime.

It is a Duffinian number.

It is a nialpdrome in base 15.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6426 + ... + 7963.

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

Almost surely, 2^11065141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 15158.

The product of its (nonzero) digits is 120, while the sum is 19.

The square root of 11065141 is about 3326.4306696518. The cubic root of 11065141 is about 222.8361522409.

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