Base | Representation |
---|---|
bin | 1001100100011000100000… |
… | …00001101011110100101000 |
3 | 2202111112022022211022122202 |
4 | 10302030100001223310220 |
5 | 10224220102244111300 |
6 | 112430125051435332 |
7 | 4301120240054561 |
oct | 462142001536450 |
9 | 82445268738582 |
10 | 21041313660200 |
11 | 6782631019359 |
12 | 2439b45455b48 |
13 | b98258840652 |
14 | 52a59550b168 |
15 | 2674ed5c1ad5 |
hex | 13231006bd28 |
21041313660200 has 96 divisors (see below), whose sum is σ = 50935797009720. Its totient is φ = 8076633600000.
The previous prime is 21041313660179. The next prime is 21041313660233. The reversal of 21041313660200 is 206631314012.
It can be written as a sum of positive squares in 12 ways, for example, as 7106308366756 + 13935005293444 = 2665766^2 + 3732962^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 20532701 + ... + 21533100.
Almost surely, 221041313660200 is an apocalyptic number.
21041313660200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21041313660200 is an abundant number, since it is smaller than the sum of its proper divisors (29894483349520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21041313660200 is a wasteful number, since it uses less digits than its factorization.
21041313660200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42065919 (or 42065910 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 21041313660200 its reverse (206631314012), we get a palindrome (21247944974212).
The spelling of 21041313660200 in words is "twenty-one trillion, forty-one billion, three hundred thirteen million, six hundred sixty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •