Base | Representation |
---|---|
bin | 101100110011001010… |
… | …011100110010000000 |
3 | 11121011101022110222110 |
4 | 230303022130302000 |
5 | 1242003333030400 |
6 | 34033114335320 |
7 | 3322015621551 |
oct | 546312346200 |
9 | 147141273873 |
10 | 48103017600 |
11 | 19444999100 |
12 | 93a572a540 |
13 | 46c7a54831 |
14 | 2484810328 |
15 | 13b8080e50 |
hex | b3329cc80 |
48103017600 has 288 divisors, whose sum is σ = 174156509520. Its totient is φ = 11661056000.
The previous prime is 48103017551. The next prime is 48103017619. The reversal of 48103017600 is 671030184.
It is a happy number.
It is a super-3 number, since 3×481030176003 (a number of 33 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 1140895 + ... + 1182305.
Almost surely, 248103017600 is an apocalyptic number.
48103017600 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 48103017600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (87078254760).
48103017600 is an abundant number, since it is smaller than the sum of its proper divisors (126053491920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48103017600 is a wasteful number, since it uses less digits than its factorization.
48103017600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41460 (or 41432 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 30.
Adding to 48103017600 its reverse (671030184), we get a palindrome (48774047784).
The spelling of 48103017600 in words is "forty-eight billion, one hundred three million, seventeen thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •