Search a number
-
+
49015641 = 317961091
BaseRepresentation
bin1011101011111…
…0101101011001
310102020020211010
42322332231121
5100022000031
64510324133
71133424513
oct272765531
9112206733
1049015641
11257391a4
12144b9649
13a20234c
14671cbb3
154483246
hex2ebeb59

49015641 has 8 divisors (see below), whose sum is σ = 69198624. Its totient is φ = 30754880.

The previous prime is 49015609. The next prime is 49015643. The reversal of 49015641 is 14651094.

It is a happy number.

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

It is a cyclic number.

It is not a de Polignac number, because 49015641 - 25 = 49015609 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (49015643) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 480495 + ... + 480596.

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

Almost surely, 249015641 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 961111.

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

The square root of 49015641 is about 7001.1171251451. The cubic root of 49015641 is about 365.9695023709.

The spelling of 49015641 in words is "forty-nine million, fifteen thousand, six hundred forty-one".

Divisors: 1 3 17 51 961091 2883273 16338547 49015641