Base | Representation |
---|---|
bin | 11001011010001100… |
… | …10101110000000000 |
3 | 1022012200221221220220 |
4 | 30231012111300000 |
5 | 210414213213220 |
6 | 10133345303040 |
7 | 662023110306 |
oct | 145506256000 |
9 | 38180857826 |
10 | 13641538560 |
11 | 5870324911 |
12 | 2788634a80 |
13 | 1395282510 |
14 | 935a46276 |
15 | 54c927540 |
hex | 32d195c00 |
13641538560 has 352 divisors, whose sum is σ = 47911590720. Its totient is φ = 3292004352.
The previous prime is 13641538529. The next prime is 13641538577. The reversal of 13641538560 is 6583514631.
It is a hoax number, since the sum of its digits (42) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10582396 + ... + 10583684.
Almost surely, 213641538560 is an apocalyptic number.
13641538560 is a gapful number since it is divisible by the number (10) 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 13641538560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23955795360).
13641538560 is an abundant number, since it is smaller than the sum of its proper divisors (34270052160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13641538560 is a wasteful number, since it uses less digits than its factorization.
13641538560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1383 (or 1365 counting only the distinct ones).
The product of its (nonzero) digits is 259200, while the sum is 42.
The spelling of 13641538560 in words is "thirteen billion, six hundred forty-one million, five hundred thirty-eight thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •