1065141 has 48 divisors (see below), whose sum is σ = 2021760. Its totient is φ = 524160.

The previous prime is 1065137. The next prime is 1065173. The reversal of 1065141 is 1415601.

1065141 = 13³ + 14³ + ... + 45³.

1065141 is a `hidden beast` number, since 10 + 651 + 4 + 1 = 666.

It is not a de Polignac number, because 1065141 - 2² = 1065137 is a prime.

It is a super-2 number, since 2×1065141² = 2269050699762, which contains 22 as substring.

It is a congruent number.

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

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

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 20071 + ... + 20123.

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

2^1065141 is an apocalyptic number.

1065141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

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

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

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

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

The square root of 1065141 is about 1032.0566844898. The cubic root of 1065141 is about 102.1258538771.

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