Search a number
-
+
49048688832 = 263111321311049
BaseRepresentation
bin101101101011100001…
…111001100011000000
311200121021202120000220
4231223201321203000
51300422431020312
634311015343040
73354320655543
oct555341714300
9150537676026
1049048688832
111988a784980
12960a381a80
13481894c200
14253425885a
1514210cec8c
hexb6b8798c0

49048688832 has 336 divisors, whose sum is σ = 154617724800. Its totient is φ = 13602201600.

The previous prime is 49048688747. The next prime is 49048688833. The reversal of 49048688832 is 23888684094.

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

It is not an unprimeable number, because it can be changed into a prime (49048688833) 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 47 ways as a sum of consecutive naturals, for example, 46757044 + ... + 46758092.

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

Almost surely, 249048688832 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 21233664, while the sum is 60.

The spelling of 49048688832 in words is "forty-nine billion, forty-eight million, six hundred eighty-eight thousand, eight hundred thirty-two".