6950141 has 8 divisors (see below), whose sum is σ = 7711200. Its totient is φ = 6210640.

The previous prime is 6950101. The next prime is 6950149. The reversal of 6950141 is 1410596.

6950141 is digitally balanced in base 3, 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 a de Polignac number, because none of the positive numbers 2^k-6950141 is a prime.

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (6950149) 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 7 ways as a sum of consecutive naturals, for example, 4706 + ... + 6003.

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

Almost surely, 2^6950141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 10779.

The product of its (nonzero) digits is 1080, while the sum is 26.

The square root of 6950141 is about 2636.3120073315. The cubic root of 6950141 is about 190.8378602606.

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