Base | Representation |
---|---|
bin | 110000000001101011111010… |
… | …111101111001010011101000 |
3 | 1000200212122012011121012001110 |
4 | 300001223322331321103220 |
5 | 210141130341211242300 |
6 | 2025122033200350320 |
7 | 62330202563251125 |
oct | 6001537275712350 |
9 | 1020778164535043 |
10 | 211222112212200 |
11 | 613358818817a1 |
12 | 1b8343160153a0 |
13 | 90b220cb8231b |
14 | 3a232c1cab74c |
15 | 196458a0b4550 |
hex | c01afaf794e8 |
211222112212200 has 96 divisors (see below), whose sum is σ = 654793122656160. Its totient is φ = 56325503059200.
The previous prime is 211222112212151. The next prime is 211222112212229. The reversal of 211222112212200 is 2212211222112.
It is a super-2 number, since 2×2112221122122002 (a number of 29 digits) contains 22 as substring.
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, 90404715 + ... + 92711685.
It is an arithmetic number, because the mean of its divisors is an integer number (6820761694335).
Almost surely, 2211222112212200 is an apocalyptic number.
211222112212200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211222112212200 is an abundant number, since it is smaller than the sum of its proper divisors (443571010443960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211222112212200 is a wasteful number, since it uses less digits than its factorization.
211222112212200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2459587 (or 2459578 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 211222112212200 its reverse (2212211222112), we get a palindrome (213434323434312).
The spelling of 211222112212200 in words is "two hundred eleven trillion, two hundred twenty-two billion, one hundred twelve million, two hundred twelve thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •