49026536 has 64 divisors (see below), whose sum is σ = 106814400. Its totient is φ = 20901888.

The previous prime is 49026533. The next prime is 49026539. The reversal of 49026536 is 63562094.

49026536 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is an interprime number because it is at equal distance from previous prime (49026533) and next prime (49026539).

It is a plaindrome in base 9.

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

It is not an unprimeable number, because it can be changed into a prime (49026533) 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, 84680 + ... + 85256.

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

Almost surely, 2^49026536 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 38880, while the sum is 35.

The square root of 49026536 is about 7001.8951720231. The cubic root of 49026536 is about 365.9966157729.

The spelling of 49026536 in words is "forty-nine million, twenty-six thousand, five hundred thirty-six".