Base | Representation |
---|---|
bin | 101001001101000011000… |
… | …1100000000000000000000 |
3 | 202001101020110210212100000 |
4 | 1102122012030000000000 |
5 | 1220240330124020200 |
6 | 20013315445200000 |
7 | 1123065604244130 |
oct | 122320614000000 |
9 | 22041213725300 |
10 | 5663018188800 |
11 | 1893744151025 |
12 | 775645400000 |
13 | 32103586108b |
14 | 15813d29cac0 |
15 | 9c494c7a300 |
hex | 52686300000 |
5663018188800 has 1512 divisors, whose sum is σ = 24232193929216. Its totient is φ = 1284211998720.
The previous prime is 5663018188787. The next prime is 5663018188889. The reversal of 5663018188800 is 88818103665.
It is a tau number, because it is divible by the number of its divisors (1512).
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 44590694337 + ... + 44590694463.
Almost surely, 25663018188800 is an apocalyptic number.
5663018188800 is a gapful number since it is divisible by the number (50) 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 5663018188800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12116096964608).
5663018188800 is an abundant number, since it is smaller than the sum of its proper divisors (18569175740416).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5663018188800 is an frugal number, since it uses more digits than its factorization.
5663018188800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 199 (or 144 counting only the distinct ones).
The product of its (nonzero) digits is 2211840, while the sum is 54.
The spelling of 5663018188800 in words is "five trillion, six hundred sixty-three billion, eighteen million, one hundred eighty-eight thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •