Search a number
-
+
1016141 = 7178539
BaseRepresentation
bin11111000000101001101
31220121212212
43320011031
5230004031
633440205
711431340
oct3700515
91817785
101016141
11634495
12410065
13297689
141c6457
1515112b
hexf814d

1016141 has 8 divisors (see below), whose sum is σ = 1229760. Its totient is φ = 819648.

The previous prime is 1016137. The next prime is 1016143. The reversal of 1016141 is 1416101.

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

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

It is a cyclic number.

It is not a de Polignac number, because 1016141 - 22 = 1016137 is a prime.

It is an Ulam number.

It is an alternating number because its digits alternate between odd and even.

It is a congruent number.

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

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

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

21016141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 8563.

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

The square root of 1016141 is about 1008.0381937209. The cubic root of 1016141 is about 100.5351642169.

The spelling of 1016141 in words is "one million, sixteen thousand, one hundred forty-one".

Divisors: 1 7 17 119 8539 59773 145163 1016141