Base | Representation |
---|---|
bin | 1100111000000010011… |
… | …1100111110000011000 |
3 | 210010221220002100101112 |
4 | 3032000213213300120 |
5 | 12111010001432300 |
6 | 245341325235452 |
7 | 21660400124066 |
oct | 3160047476030 |
9 | 703856070345 |
10 | 221201202200 |
11 | 858a1348210 |
12 | 36a53a02b88 |
13 | 17b2281c534 |
14 | a9c5b2b036 |
15 | 5b498b6e35 |
hex | 33809e7c18 |
221201202200 has 96 divisors (see below), whose sum is σ = 561626397360. Its totient is φ = 80353689600.
The previous prime is 221201202121. The next prime is 221201202251. The reversal of 221201202200 is 2202102122.
It is a congruent number.
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, 2097944 + ... + 2200856.
Almost surely, 2221201202200 is an apocalyptic number.
221201202200 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 221201202200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (280813198680).
221201202200 is an abundant number, since it is smaller than the sum of its proper divisors (340425195160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
221201202200 is a wasteful number, since it uses less digits than its factorization.
221201202200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103917 (or 103908 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 221201202200 its reverse (2202102122), we get a palindrome (223403304322).
The spelling of 221201202200 in words is "two hundred twenty-one billion, two hundred one million, two hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •