Search a number
-
+
6940435 = 53144777
BaseRepresentation
bin11010011110011100010011
3111001121111011
4122132130103
53234043220
6404431351
7112664335
oct32363423
914047434
106940435
113a104a7
1223a8557
131590088
14cc9455
1592165a
hex69e713

6940435 has 8 divisors (see below), whose sum is σ = 8597376. Its totient is φ = 5373120.

The previous prime is 6940433. The next prime is 6940441. The reversal of 6940435 is 5340496.

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

It is not a de Polignac number, because 6940435 - 21 = 6940433 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (31).

It is a Duffinian number.

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

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

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

Almost surely, 26940435 is an apocalyptic number.

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

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

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

The sum of its prime factors is 44813.

The product of its (nonzero) digits is 12960, while the sum is 31.

The square root of 6940435 is about 2634.4705350411. The cubic root of 6940435 is about 190.7489826783.

It can be divided in two parts, 69 and 40435, that added together give a palindrome (40504).

The spelling of 6940435 in words is "six million, nine hundred forty thousand, four hundred thirty-five".

Divisors: 1 5 31 155 44777 223885 1388087 6940435