Base | Representation |
---|---|
bin | 1101001000000001110110… |
… | …10011101101101101000000 |
3 | 10210012021220022101000020110 |
4 | 12210000323103231231000 |
5 | 12240343240331042200 |
6 | 141215320515311320 |
7 | 6036203250440520 |
oct | 644007323555500 |
9 | 123167808330213 |
10 | 28863175252800 |
11 | 9218892a72499 |
12 | 32a1a62bab540 |
13 | 1314a2a397145 |
14 | 71adb12db680 |
15 | 350be64a1b50 |
hex | 1a403b4edb40 |
28863175252800 has 672 divisors, whose sum is σ = 115189610250240. Its totient is φ = 6176688537600.
The previous prime is 28863175252781. The next prime is 28863175252913. The reversal of 28863175252800 is 825257136882.
It is a tau number, because it is divible by the number of its divisors (672).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 108966921 + ... + 109231479.
Almost surely, 228863175252800 is an apocalyptic number.
28863175252800 is a gapful number since it is divisible by the number (20) 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 28863175252800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57594805125120).
28863175252800 is an abundant number, since it is smaller than the sum of its proper divisors (86326434997440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28863175252800 is a wasteful number, since it uses less digits than its factorization.
28863175252800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 264799 (or 264784 counting only the distinct ones).
The product of its (nonzero) digits is 12902400, while the sum is 57.
The spelling of 28863175252800 in words is "twenty-eight trillion, eight hundred sixty-three billion, one hundred seventy-five million, two hundred fifty-two thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •