Search a number
BaseRepresentation
bin100000011100011100101
32000000100121
410003203211
5233010031
634441541
712015352
oct4034345
92000317
101063141
11666832
124332b1
132b2ba1
141d9629
15160011
hex1038e5

1063141 has 4 divisors (see below), whose sum is σ = 1066912. Its totient is φ = 1059372.

The previous prime is 1063123. The next prime is 1063151. The reversal of 1063141 is 1413601.

Adding to 1063141 its reverse (1413601), we get a palindrome (2476742).

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.

It is a cyclic number.

It is not a de Polignac number, because 1063141 - 25 = 1063109 is a prime.

It is a super-2 number, since 2×10631412 = 2260537571762, which contains 22 as substring.

It is a Duffinian number.

1063141 is a lucky number.

It is a congruent number.

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

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

It is a 282-hyperperfect number.

21063141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3770.

The product of its (nonzero) digits is 72, while the sum is 16.

The square root of 1063141 is about 1031.0872901942. The cubic root of 1063141 is about 102.0618937437.

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

Divisors: 1 307 3463 1063141