Base | Representation |
---|---|
bin | 1001101000100111101010… |
… | …00100010110000000000000 |
3 | 2210000110001210212211212001 |
4 | 10310103311010112000000 |
5 | 10234111222401313410 |
6 | 113021042323313344 |
7 | 4314462614542000 |
oct | 464236504260000 |
9 | 83013053784761 |
10 | 21186890260480 |
11 | 682934523585a |
12 | 24621b281b854 |
13 | ba8bb8856109 |
14 | 533645612000 |
15 | 26b1bdb9433a |
hex | 1344f5116000 |
21186890260480 has 896 divisors, whose sum is σ = 62394852096000. Its totient is φ = 6889856827392.
The previous prime is 21186890260453. The next prime is 21186890260499. The reversal of 21186890260480 is 8406209868112.
It is a tau number, because it is divible by the number of its divisors (896).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 55902084931 + ... + 55902085309.
Almost surely, 221186890260480 is an apocalyptic number.
21186890260480 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 21186890260480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31197426048000).
21186890260480 is an abundant number, since it is smaller than the sum of its proper divisors (41207961835520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21186890260480 is an equidigital number, since it uses as much as digits as its factorization.
21186890260480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 627 (or 589 counting only the distinct ones).
The product of its (nonzero) digits is 2654208, while the sum is 55.
The spelling of 21186890260480 in words is "twenty-one trillion, one hundred eighty-six billion, eight hundred ninety million, two hundred sixty thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •