Search a number
-
+
49094935 = 561160967
BaseRepresentation
bin1011101101001…
…0000100010111
310102101021120221
42323102010113
5100032014220
64512135211
71134204631
oct273220427
9112337527
1049094935
112579282a
1214537507
13a22c476
14673da51
15449b9aa
hex2ed2117

49094935 has 8 divisors (see below), whose sum is σ = 59880096. Its totient is φ = 38631840.

The previous prime is 49094933. The next prime is 49094953. The reversal of 49094935 is 53949094.

49094935 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 49094935 - 21 = 49094933 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

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

Almost surely, 249094935 is an apocalyptic number.

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

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

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

The sum of its prime factors is 161033.

The product of its (nonzero) digits is 174960, while the sum is 43.

The square root of 49094935 is about 7006.7777901115. Note that the first 4 decimals coincide. The cubic root of 49094935 is about 366.1667424816.

The spelling of 49094935 in words is "forty-nine million, ninety-four thousand, nine hundred thirty-five".

Divisors: 1 5 61 305 160967 804835 9818987 49094935