Base | Representation |
---|---|
bin | 1001101101110010101010… |
… | …11101110010101000000000 |
3 | 2210122102202210101002211110 |
4 | 10312321111131302220000 |
5 | 10300014200402000300 |
6 | 113234432353443320 |
7 | 4333353506614503 |
oct | 466712535625000 |
9 | 83572683332743 |
10 | 21364601203200 |
11 | 6897749450362 |
12 | 2490729870540 |
13 | bbc89a1871a8 |
14 | 53c0a33cb13a |
15 | 270b2043d550 |
hex | 136e55772a00 |
21364601203200 has 240 divisors, whose sum is σ = 71772846377760. Its totient is φ = 5600663224320.
The previous prime is 21364601203189. The next prime is 21364601203213. The reversal of 21364601203200 is 230210646312.
It is a tau number, because it is divible by the number of its divisors (240).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2449399 + ... + 6980598.
It is an arithmetic number, because the mean of its divisors is an integer number (299053526574).
Almost surely, 221364601203200 is an apocalyptic number.
21364601203200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21364601203200 is an abundant number, since it is smaller than the sum of its proper divisors (50408245174560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21364601203200 is an equidigital number, since it uses as much as digits as its factorization.
21364601203200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9430087 (or 9430066 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 30.
Adding to 21364601203200 its reverse (230210646312), we get a palindrome (21594811849512).
The spelling of 21364601203200 in words is "twenty-one trillion, three hundred sixty-four billion, six hundred one million, two hundred three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •