1046952 has 64 divisors (see below), whose sum is σ = 3009600. Its totient is φ = 336960.

The previous prime is 1046951. The next prime is 1046959. The reversal of 1046952 is 2596401.

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

It is a Harshad number since it is a multiple of its sum of digits (27).

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

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 15 ways as a sum of consecutive naturals, for example, 7927 + ... + 8057.

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

2^1046952 is an apocalyptic number.

1046952 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 1046952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1504800).

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

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

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

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

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

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

The square root of 1046952 is about 1023.2067239810. The cubic root of 1046952 is about 101.5411919164.

It can be divided in two parts, 104 and 6952, that added together give a square (7056 = 84²).

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