1049622 has 32 divisors (see below), whose sum is σ = 2441472. Its totient is φ = 294624.

The previous prime is 1049611. The next prime is 1049623. The reversal of 1049622 is 2269401.

1049622 is nontrivially palindromic in base 13.

It is a super-2 number, since 2×1049622² = 2203412685768, which contains 22 as substring.

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

It is a congruent number.

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

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

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

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

2^1049622 is an apocalyptic number.

It is a practical number, because each smaller number is the sum of distinct divisors of 1049622, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1220736).

1049622 is an abundant number, since it is smaller than the sum of its proper divisors (1391850).

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

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

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

The sum of its prime factors is 452.

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

The square root of 1049622 is about 1024.5106148791. The cubic root of 1049622 is about 101.6274374613.

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