Search a number
-
+
1017141 = 33110937
BaseRepresentation
bin11111000010100110101
31220200020220
43320110311
5230022031
633444553
711434266
oct3702465
91820226
101017141
11635214
12410759
13297c78
141c696d
15151596
hexf8535

1017141 has 8 divisors (see below), whose sum is σ = 1400064. Its totient is φ = 656160.

The previous prime is 1017139. The next prime is 1017157. The reversal of 1017141 is 1417101.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 1017141 - 21 = 1017139 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 1017141.

It is a congruent number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5376 + ... + 5561.

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

21017141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 10971.

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

The square root of 1017141 is about 1008.5340846992. The cubic root of 1017141 is about 100.5681328052.

The spelling of 1017141 in words is "one million, seventeen thousand, one hundred forty-one".

Divisors: 1 3 31 93 10937 32811 339047 1017141