49826952 has 96 divisors (see below), whose sum is σ = 155812800. Its totient is φ = 14090112.

The previous prime is 49826929. The next prime is 49826957. The reversal of 49826952 is 25962894.

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

It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.

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

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

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

Almost surely, 2^49826952 is an apocalyptic number.

49826952 is a gapful number since it is divisible by the number (42) 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 49826952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (77906400).

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

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

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

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

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

The product of its digits is 311040, while the sum is 45.

The square root of 49826952 is about 7058.8208647054. The cubic root of 49826952 is about 367.9776490836.

The spelling of 49826952 in words is "forty-nine million, eight hundred twenty-six thousand, nine hundred fifty-two".