Search a number
-
+
49570131 = 3131271029
BaseRepresentation
bin1011110100011…
…0000101010011
310110021102102210
42331012011103
5100142221011
64530243203
71141224222
oct275060523
9113242383
1049570131
1125a87856
1214726503
13a367850
146824cb9
1545426a6
hex2f46153

49570131 has 8 divisors (see below), whose sum is σ = 71177680. Its totient is φ = 30504672.

The previous prime is 49570127. The next prime is 49570153. The reversal of 49570131 is 13107594.

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

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 49570131 - 22 = 49570127 is a prime.

It is a super-2 number, since 2×495701312 = 4914395774714322, which contains 22 as substring.

It is a Duffinian number.

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

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

Almost surely, 249570131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1271045.

The product of its (nonzero) digits is 3780, while the sum is 30.

The square root of 49570131 is about 7040.6058688156. The cubic root of 49570131 is about 367.3443424277.

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

Divisors: 1 3 13 39 1271029 3813087 16523377 49570131