Cookie Consent by FreePrivacyPolicy.com
Search a number
BaseRepresentation
bin11111000000011001101
31220121201010
43320003031
5230003023
633435433
711431065
oct3700315
91817633
101016013
11634389
1240bb79
132975bb
141c63a5
15151093
hexf80cd

1016013 has 8 divisors (see below), whose sum is σ = 1360800. Its totient is φ = 674288.

The previous prime is 1016011. The next prime is 1016023. The reversal of 1016013 is 3106101.

1016013 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 1016013 - 21 = 1016011 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 1016013.

It is a congruent number.

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

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

21016013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1531.

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

The square root of 1016013 is about 1007.9747020635. The cubic root of 1016013 is about 100.5309426763.

Adding to 1016013 its sum of digits (12), we get a triangular number (1016025 = T1425).

The spelling of 1016013 in words is "one million, sixteen thousand, thirteen".

Divisors: 1 3 269 807 1259 3777 338671 1016013