Base | Representation |
---|---|
bin | 101100111100100001… |
… | …111001101000000000 |
3 | 11121120100000010211100 |
4 | 230330201321220000 |
5 | 1242314100110000 |
6 | 34100450414400 |
7 | 3325634406633 |
oct | 547441715000 |
9 | 147510003740 |
10 | 48260160000 |
11 | 19515669558 |
12 | 942a291400 |
13 | 47214846c0 |
14 | 249b637c1a |
15 | 13c6c71a00 |
hex | b3c879a00 |
48260160000 has 600 divisors, whose sum is σ = 187580533140. Its totient is φ = 11870208000.
The previous prime is 48260159971. The next prime is 48260160023. The reversal of 48260160000 is 6106284.
It can be written as a sum of positive squares in 10 ways, for example, as 4522293504 + 43737866496 = 67248^2 + 209136^2 .
It is a tau number, because it is divible by the number of its divisors (600).
It is an unprimeable number.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 37439356 + ... + 37440644.
Almost surely, 248260160000 is an apocalyptic number.
48260160000 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 48260160000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (93790266570).
48260160000 is an abundant number, since it is smaller than the sum of its proper divisors (139320373140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48260160000 is a wasteful number, since it uses less digits than its factorization.
48260160000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1346 (or 1312 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
Adding to 48260160000 its reverse (6106284), we get a palindrome (48266266284).
The spelling of 48260160000 in words is "forty-eight billion, two hundred sixty million, one hundred sixty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •