Search a number
-
+
49022940637 = 118353694349
BaseRepresentation
bin101101101001111111…
…101011010111011101
311200112111022102011001
4231221333223113131
51300344333100022
634304255430301
73353556056116
oct555177532735
9150474272131
1049022940637
1119877198980
129601825391
1348135055a8
142530a7520d
15141dbe5b27
hexb69feb5dd

49022940637 has 8 divisors (see below), whose sum is σ = 54123904800. Its totient is φ = 44029365360.

The previous prime is 49022940607. The next prime is 49022940667. The reversal of 49022940637 is 73604922094.

It is an interprime number because it is at equal distance from previous prime (49022940607) and next prime (49022940667).

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 49022940637 - 27 = 49022940509 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

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

Almost surely, 249022940637 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 53694443.

The product of its (nonzero) digits is 653184, while the sum is 46.

The spelling of 49022940637 in words is "forty-nine billion, twenty-two million, nine hundred forty thousand, six hundred thirty-seven".

Divisors: 1 11 83 913 53694349 590637839 4456630967 49022940637