1046922 has 8 divisors (see below), whose sum is σ = 2093856. Its totient is φ = 348972.

The previous prime is 1046917. The next prime is 1046933. The reversal of 1046922 is 2296401.

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

1046922 is an admirable number.

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

It is an unprimeable number.

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 3 ways as a sum of consecutive naturals, for example, 87238 + ... + 87249.

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

2^1046922 is an apocalyptic number.

1046922 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 174492.

The product of its (nonzero) digits is 864, while the sum is 24.

The square root of 1046922 is about 1023.1920640818. The cubic root of 1046922 is about 101.5402220328.

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