Base | Representation |
---|---|
bin | 1100010101110101100… |
… | …0011111110001111110 |
3 | 202021021001020001011112 |
4 | 3011131120133301332 |
5 | 11433204121201342 |
6 | 241222314322022 |
7 | 21214025054660 |
oct | 3053530376176 |
9 | 667231201145 |
10 | 212020100222 |
11 | 81a0a901427 |
12 | 35111129312 |
13 | 16cbb6a0908 |
14 | a394652530 |
15 | 57ad865682 |
hex | 315d61fc7e |
212020100222 has 8 divisors (see below), whose sum is σ = 363463028976. Its totient is φ = 90865757232.
The previous prime is 212020100219. The next prime is 212020100273. The reversal of 212020100222 is 222001020212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 15144292873 = 212020100222 / (2 + 1 + 2 + 0 + 2 + 0 + 1 + 0 + 0 + 2 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 212020100197 and 212020100206.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7572146423 + ... + 7572146450.
It is an arithmetic number, because the mean of its divisors is an integer number (45432878622).
Almost surely, 2212020100222 is an apocalyptic number.
212020100222 is a deficient number, since it is larger than the sum of its proper divisors (151442928754).
212020100222 is a wasteful number, since it uses less digits than its factorization.
212020100222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15144292882.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 212020100222 its reverse (222001020212), we get a palindrome (434021120434).
The spelling of 212020100222 in words is "two hundred twelve billion, twenty million, one hundred thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •