Base | Representation |
---|---|
bin | 10110000011111011010000… |
… | …01000010010011000000000 |
3 | 20100202211120102220022121201 |
4 | 23001331220020102120000 |
5 | 22324320422032024300 |
6 | 251102425520030544 |
7 | 13134656225205562 |
oct | 1301755010223000 |
9 | 210684512808551 |
10 | 48513402611200 |
11 | 1450446703998a |
12 | 5536280462454 |
13 | 210ba42c25357 |
14 | bda0bdd8b332 |
15 | 591e2924466a |
hex | 2c1f68212600 |
48513402611200 has 240 divisors, whose sum is σ = 125485546196736. Its totient is φ = 18552193228800.
The previous prime is 48513402611173. The next prime is 48513402611231. The reversal of 48513402611200 is 211620431584.
It is a self number, because there is not a number n which added to its sum of digits gives 48513402611200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 591997429 + ... + 592079371.
Almost surely, 248513402611200 is an apocalyptic number.
48513402611200 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 48513402611200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (62742773098368).
48513402611200 is an abundant number, since it is smaller than the sum of its proper divisors (76972143585536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48513402611200 is a wasteful number, since it uses less digits than its factorization.
48513402611200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84005 (or 83984 counting only the distinct ones).
The product of its (nonzero) digits is 46080, while the sum is 37.
The spelling of 48513402611200 in words is "forty-eight trillion, five hundred thirteen billion, four hundred two million, six hundred eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •