Search a number
-
+
48649025152 = 27721319311013
BaseRepresentation
bin101101010011101101…
…010011011010000000
311122120102201112112101
4231103231103122000
51244113122301102
634203221240144
73341365614400
oct552355233200
9148512645471
1048649025152
11196a5119712
129518563054
134783bc7a20
1424d7140800
1513eae85e87
hexb53b53680

48649025152 has 384 divisors, whose sum is σ = 132056870400. Its totient is φ = 17627258880.

The previous prime is 48649025143. The next prime is 48649025153. The reversal of 48649025152 is 25152094684.

It is not an unprimeable number, because it can be changed into a prime (48649025153) 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, 48024198 + ... + 48025210.

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

Almost surely, 248649025152 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 48649025152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (66028435200).

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

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

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

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

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

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

The spelling of 48649025152 in words is "forty-eight billion, six hundred forty-nine million, twenty-five thousand, one hundred fifty-two".