Base | Representation |
---|---|
bin | 1100010110100000111… |
… | …0011110010101001110 |
3 | 202021201201112122020101 |
4 | 3011220032132111032 |
5 | 11434042204202342 |
6 | 241252333441314 |
7 | 21221364266551 |
oct | 3055016362516 |
9 | 667651478211 |
10 | 212202022222 |
11 | 81aa3567093 |
12 | 3516204023a |
13 | 1701a298578 |
14 | a3b088a698 |
15 | 57be7ed3b7 |
hex | 316839e54e |
212202022222 has 8 divisors (see below), whose sum is σ = 318430209456. Its totient is φ = 106058619072.
The previous prime is 212202022159. The next prime is 212202022223. The reversal of 212202022222 is 222220202212.
212202022222 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 212202022222.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212202022223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21189763 + ... + 21199774.
It is an arithmetic number, because the mean of its divisors is an integer number (39803776182).
Almost surely, 2212202022222 is an apocalyptic number.
212202022222 is a deficient number, since it is larger than the sum of its proper divisors (106228187234).
212202022222 is a wasteful number, since it uses less digits than its factorization.
212202022222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42392042.
The product of its (nonzero) digits is 512, while the sum is 19.
Adding to 212202022222 its reverse (222220202212), we get a palindrome (434422224434).
The spelling of 212202022222 in words is "two hundred twelve billion, two hundred two million, twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •