Base | Representation |
---|---|
bin | 101100110011010010… |
… | …110110010000110000 |
3 | 11121011112110022220020 |
4 | 230303102312100300 |
5 | 1242004414002440 |
6 | 34033233443440 |
7 | 3322043421150 |
oct | 546322662060 |
9 | 147145408806 |
10 | 48105219120 |
11 | 19446162142 |
12 | 93a6410580 |
13 | 46c83458ca |
14 | 2484c24760 |
15 | 13b83683d0 |
hex | b334b6430 |
48105219120 has 320 divisors, whose sum is σ = 173341762560. Its totient is φ = 10809114624.
The previous prime is 48105219037. The next prime is 48105219133. The reversal of 48105219120 is 2191250184.
It is a super-3 number, since 3×481052191203 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 28856527 + ... + 28858193.
It is an arithmetic number, because the mean of its divisors is an integer number (541693008).
Almost surely, 248105219120 is an apocalyptic number.
48105219120 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 48105219120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (86670881280).
48105219120 is an abundant number, since it is smaller than the sum of its proper divisors (125236543440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48105219120 is a wasteful number, since it uses less digits than its factorization.
48105219120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1972 (or 1966 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 33.
The spelling of 48105219120 in words is "forty-eight billion, one hundred five million, two hundred nineteen thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •