Base | Representation |
---|---|
bin | 101101001011100100… |
… | …000100100000000000 |
3 | 11122012220121121022202 |
4 | 231023210010200000 |
5 | 1243323132341242 |
6 | 34141500452332 |
7 | 3335116325552 |
oct | 551344044000 |
9 | 148186547282 |
10 | 48512387072 |
11 | 19634a83486 |
12 | 949a84a0a8 |
13 | 47617c69a6 |
14 | 24c2d334d2 |
15 | 13dde95932 |
hex | b4b904800 |
48512387072 has 108 divisors (see below), whose sum is σ = 100873572345. Its totient is φ = 23324221440.
The previous prime is 48512387069. The next prime is 48512387111. The reversal of 48512387072 is 27078321584.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 46338589696 + 2173797376 = 215264^2 + 46624^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=155744.
It is a Duffinian number.
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 8 ways as a sum of consecutive naturals, for example, 308996018 + ... + 308996174.
Almost surely, 248512387072 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 48512387072
48512387072 is an abundant number, since it is smaller than the sum of its proper divisors (52361185273).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48512387072 is an frugal number, since it uses more digits than its factorization.
48512387072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 398 (or 190 counting only the distinct ones).
The product of its (nonzero) digits is 752640, while the sum is 47.
The spelling of 48512387072 in words is "forty-eight billion, five hundred twelve million, three hundred eighty-seven thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •