10496322 has 48 divisors (see below), whose sum is σ = 24485760. Its totient is φ = 3239136.

The previous prime is 10496309. The next prime is 10496323. The reversal of 10496322 is 22369401.

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

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

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15748 + ... + 16400.

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

Almost surely, 2^10496322 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 2592, while the sum is 27.

The square root of 10496322 is about 3239.8027717748. The cubic root of 10496322 is about 218.9503859586.

The spelling of 10496322 in words is "ten million, four hundred ninety-six thousand, three hundred twenty-two".