1036632 has 32 divisors (see below), whose sum is σ = 2649600. Its totient is φ = 337824.

The previous prime is 1036631. The next prime is 1036649. The reversal of 1036632 is 2366301.

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

It is a congruent number.

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

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

2^1036632 is an apocalyptic number.

1036632 is a gapful number since it is divisible by the number (12) formed by its first and last digit.

It is an amenable number.

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

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

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

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

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

The sum of its prime factors is 975 (or 971 counting only the distinct ones).

The product of its (nonzero) digits is 648, while the sum is 21.

The square root of 1036632 is about 1018.1512657754. The cubic root of 1036632 is about 101.2064528477.

The spelling of 1036632 in words is "one million, thirty-six thousand, six hundred thirty-two".