Search a number
-
+
6909141 = 319472579
BaseRepresentation
bin11010010110110011010101
3111000000120010
4122112303111
53232043031
6404030433
7112504161
oct32266325
914000503
106909141
113999a38
122392419
13157ba65
14cbbca1
15917246
hex696cd5

6909141 has 16 divisors (see below), whose sum is σ = 9907200. Its totient is φ = 4269168.

The previous prime is 6909127. The next prime is 6909151. The reversal of 6909141 is 1419096.

6909141 = 5942 + 5952 + ... + 6122.

It is not a de Polignac number, because 6909141 - 25 = 6909109 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 6909099 and 6909108.

It is a congruent number.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1390 + ... + 3968.

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

Almost surely, 26909141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2648.

The product of its (nonzero) digits is 1944, while the sum is 30.

The square root of 6909141 is about 2628.5244910406. The cubic root of 6909141 is about 190.4618588433.

It can be divided in two parts, 6909 and 141, that multiplied together give a square (974169 = 9872).

The spelling of 6909141 in words is "six million, nine hundred nine thousand, one hundred forty-one".

Divisors: 1 3 19 47 57 141 893 2579 2679 7737 49001 121213 147003 363639 2303047 6909141