Base | Representation |
---|---|
bin | 1100111101110110010011… |
… | …10110111101111101000000 |
3 | 10201221212000110000201022201 |
4 | 12132323021312331331000 |
5 | 12214130400130301200 |
6 | 140350510555242544 |
7 | 6002011061106220 |
oct | 636731166757500 |
9 | 121855013021281 |
10 | 28513379540800 |
11 | 90a3502454800 |
12 | 3246101149454 |
13 | 12baa52c247bb |
14 | 7080aaa46080 |
15 | 346a72352c6a |
hex | 19eec9dbdf40 |
28513379540800 has 1008 divisors, whose sum is σ = 91929952328704. Its totient is φ = 8510717952000.
The previous prime is 28513379540771. The next prime is 28513379540837. The reversal of 28513379540800 is 804597331582.
It is a Harshad number since it is a multiple of its sum of digits (55).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 4075082902 + ... + 4075089898.
Almost surely, 228513379540800 is an apocalyptic number.
28513379540800 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 28513379540800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45964976164352).
28513379540800 is an abundant number, since it is smaller than the sum of its proper divisors (63416572787904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28513379540800 is a wasteful number, since it uses less digits than its factorization.
28513379540800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7176 (or 7150 counting only the distinct ones).
The product of its (nonzero) digits is 7257600, while the sum is 55.
The spelling of 28513379540800 in words is "twenty-eight trillion, five hundred thirteen billion, three hundred seventy-nine million, five hundred forty thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •