Base | Representation |
---|---|
bin | 101101001011001011… |
… | …001001000010110000 |
3 | 11122012110022121000000 |
4 | 231023023021002300 |
5 | 1243314444231310 |
6 | 34141104430000 |
7 | 3335006640240 |
oct | 551313110260 |
9 | 148173277000 |
10 | 48505852080 |
11 | 1963131a664 |
12 | 9498618300 |
13 | 476034932a |
14 | 24c2111b20 |
15 | 13dd6044c0 |
hex | b4b2c90b0 |
48505852080 has 560 divisors, whose sum is σ = 194931880704. Its totient is φ = 10990287360.
The previous prime is 48505852069. The next prime is 48505852103. The reversal of 48505852080 is 8025850584.
48505852080 is a `hidden beast` number, since 48 + 5 + 0 + 5 + 8 + 520 + 80 = 666.
It is a tau number, because it is divible by the number of its divisors (560).
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 111 ways as a sum of consecutive naturals, for example, 53478987 + ... + 53479893.
Almost surely, 248505852080 is an apocalyptic number.
48505852080 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 48505852080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (97465940352).
48505852080 is an abundant number, since it is smaller than the sum of its proper divisors (146426028624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48505852080 is a wasteful number, since it uses less digits than its factorization.
48505852080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1076 (or 1055 counting only the distinct ones).
The product of its (nonzero) digits is 512000, while the sum is 45.
The spelling of 48505852080 in words is "forty-eight billion, five hundred five million, eight hundred fifty-two thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •