9406641 has 4 divisors (see below), whose sum is σ = 12542192. Its totient is φ = 6271092.

The previous prime is 9406619. The next prime is 9406651. The reversal of 9406641 is 1466049.

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

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 9406641 - 2⁷ = 9406513 is a prime.

It is a Duffinian number.

It is a Curzon number.

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

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1567771 + ... + 1567776.

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

Almost surely, 2^9406641 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3135550.

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

The square root of 9406641 is about 3067.0247798151. The cubic root of 9406641 is about 211.0951181996.

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