Base | Representation |
---|---|
bin | 101100110011011111… |
… | …010111010011111100 |
3 | 11121011202122000201110 |
4 | 230303133113103330 |
5 | 1242011234001340 |
6 | 34033432042020 |
7 | 3322113335064 |
oct | 546337272374 |
9 | 147152560643 |
10 | 48108500220 |
11 | 19447aa32a0 |
12 | 93a7533310 |
13 | 46c8c241a1 |
14 | 248543a3a4 |
15 | 13b87b5680 |
hex | b337d74fc |
48108500220 has 192 divisors, whose sum is σ = 148628100096. Its totient is φ = 11530014720.
The previous prime is 48108500207. The next prime is 48108500221. The reversal of 48108500220 is 2200580184.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48108500221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 48252762 + ... + 48253758.
It is an arithmetic number, because the mean of its divisors is an integer number (774104688).
Almost surely, 248108500220 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 48108500220, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (74314050048).
48108500220 is an abundant number, since it is smaller than the sum of its proper divisors (100519599876).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48108500220 is a wasteful number, since it uses less digits than its factorization.
48108500220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1780 (or 1778 counting only the distinct ones).
The product of its (nonzero) digits is 5120, while the sum is 30.
The spelling of 48108500220 in words is "forty-eight billion, one hundred eight million, five hundred thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •