Base | Representation |
---|---|
bin | 1001010010111100100110… |
… | …1100101001100100011000 |
3 | 1100012010110210211001200121 |
4 | 2110233021230221210120 |
5 | 2314430313421402300 |
6 | 33423302535443024 |
7 | 2103310443023446 |
oct | 224571154514430 |
9 | 40163423731617 |
10 | 10221111122200 |
11 | 3290826845850 |
12 | 1190b05526474 |
13 | 591b010c8584 |
14 | 2749c0ccbb96 |
15 | 12ad1b96481a |
hex | 94bc9b29918 |
10221111122200 has 48 divisors (see below), whose sum is σ = 25924454579160. Its totient is φ = 3716767680000.
The previous prime is 10221111122171. The next prime is 10221111122263. The reversal of 10221111122200 is 222111112201.
It is a super-2 number, since 2×102211111222002 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2322977601 + ... + 2322982000.
Almost surely, 210221111122200 is an apocalyptic number.
10221111122200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10221111122200 is an abundant number, since it is smaller than the sum of its proper divisors (15703343456960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10221111122200 is a wasteful number, since it uses less digits than its factorization.
10221111122200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4645959628 (or 4645959619 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 10221111122200 its reverse (222111112201), we get a palindrome (10443222234401).
Subtracting from 10221111122200 its reverse (222111112201), we obtain a palindrome (9999000009999).
The spelling of 10221111122200 in words is "ten trillion, two hundred twenty-one billion, one hundred eleven million, one hundred twenty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •