Base | Representation |
---|---|
bin | 11001001011011… |
… | …11011011111100 |
3 | 112201110002200010 |
4 | 30211233123330 |
5 | 413033021340 |
6 | 32543103220 |
7 | 5143225251 |
oct | 1445573374 |
9 | 481402603 |
10 | 211220220 |
11 | a9256972 |
12 | 5a8a1b10 |
13 | 349b53a3 |
14 | 200a3428 |
15 | 13823b80 |
hex | c96f6fc |
211220220 has 48 divisors (see below), whose sum is σ = 592064928. Its totient is φ = 56263680.
The previous prime is 211220153. The next prime is 211220231. The reversal of 211220220 is 22022112.
It is a super-2 number, since 2×2112202202 = 89227962673696800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 211220196 and 211220205.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 87672 + ... + 90048.
It is an arithmetic number, because the mean of its divisors is an integer number (12334686).
Almost surely, 2211220220 is an apocalyptic number.
211220220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211220220 is an abundant number, since it is smaller than the sum of its proper divisors (380844708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211220220 is a wasteful number, since it uses less digits than its factorization.
211220220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3870 (or 3868 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
The square root of 211220220 is about 14533.4173544972. The cubic root of 211220220 is about 595.5412254035.
Adding to 211220220 its reverse (22022112), we get a palindrome (233242332).
The spelling of 211220220 in words is "two hundred eleven million, two hundred twenty thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •