Base | Representation |
---|---|
bin | 110000000001100000101111… |
… | …000111011000011001111100 |
3 | 1000200211111012011122222022101 |
4 | 300001200233013120121330 |
5 | 210140431242131242340 |
6 | 2025112325332354444 |
7 | 62326266141034666 |
oct | 6001405707303174 |
9 | 1020744164588271 |
10 | 211210102212220 |
11 | 6133077950aa81 |
12 | 1b831b23a75a24 |
13 | 90b1047928c67 |
14 | 3a228a2c09536 |
15 | 19640d5a1ac9a |
hex | c0182f1d867c |
211210102212220 has 48 divisors (see below), whose sum is σ = 457926251747328. Its totient is φ = 81744953532480.
The previous prime is 211210102212181. The next prime is 211210102212223. The reversal of 211210102212220 is 22212201012112.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211210102212223) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25063362 + ... + 32412841.
It is an arithmetic number, because the mean of its divisors is an integer number (9540130244736).
Almost surely, 2211210102212220 is an apocalyptic number.
211210102212220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211210102212220 is an abundant number, since it is smaller than the sum of its proper divisors (246716149535108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211210102212220 is a wasteful number, since it uses less digits than its factorization.
211210102212220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57482170 (or 57482168 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 211210102212220 its reverse (22212201012112), we get a palindrome (233422303224332).
The spelling of 211210102212220 in words is "two hundred eleven trillion, two hundred ten billion, one hundred two million, two hundred twelve thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •