Search a number
-
+
49104603647 = 1147186750873
BaseRepresentation
bin101101101110110111…
…001100100111111111
311200202011222022201222
4231232313030213333
51301031234304042
634320334023555
73355600146521
oct555667144777
9150664868658
1049104603647
11199092a5570
129625047bbb
1348273c88b8
14253b851a11
151425e772d2
hexb6edcc9ff

49104603647 has 16 divisors (see below), whose sum is σ = 54738796032. Its totient is φ = 43666489920.

The previous prime is 49104603629. The next prime is 49104603671. The reversal of 49104603647 is 74630640194.

It is a cyclic number.

It is not a de Polignac number, because 49104603647 - 210 = 49104602623 is a prime.

It is a super-2 number, since 2×491046036472 (a number of 22 digits) contains 22 as substring.

It is a Duffinian number.

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

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 939803 + ... + 990675.

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

Almost surely, 249104603647 is an apocalyptic number.

49104603647 is a gapful number since it is divisible by the number (47) formed by its first and last digit.

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

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

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

The sum of its prime factors is 52798.

The product of its (nonzero) digits is 435456, while the sum is 44.

The spelling of 49104603647 in words is "forty-nine billion, one hundred four million, six hundred three thousand, six hundred forty-seven".

Divisors: 1 11 47 517 1867 20537 50873 87749 559603 965239 2391031 26301341 94979891 1044778801 4464054877 49104603647