49072131 has 12 divisors (see below), whose sum is σ = 71353360. Its totient is φ = 32497200.

The previous prime is 49072099. The next prime is 49072139. The reversal of 49072131 is 13127094.

It is not a de Polignac number, because 49072131 - 2⁵ = 49072099 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 2^49072131 is an apocalyptic number.

49072131 is a deficient number, since it is larger than the sum of its proper divisors (22281229).

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

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

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

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

The square root of 49072131 is about 7005.1503195863. The cubic root of 49072131 is about 366.1100403693.

The spelling of 49072131 in words is "forty-nine million, seventy-two thousand, one hundred thirty-one".