Search a number
-
+
49422704640 = 213351759401
BaseRepresentation
bin101110000001110100…
…101010000000000000
311201120100112112021020
4232001310222000000
51302204203022030
634412100025440
73366512025621
oct560164520000
9151510475236
1049422704640
1119a61912551
1296b3692280
13487829363a
14256bbb7a48
151443d5e510
hexb81d2a000

49422704640 has 448 divisors, whose sum is σ = 170708238720. Its totient is φ = 12163481600.

The previous prime is 49422704621. The next prime is 49422704663. The reversal of 49422704640 is 4640722494.

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 123248440 + ... + 123248840.

Almost surely, 249422704640 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 49422704640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (85354119360).

49422704640 is an abundant number, since it is smaller than the sum of its proper divisors (121285534080).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 511 (or 487 counting only the distinct ones).

The product of its (nonzero) digits is 387072, while the sum is 42.

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