Base | Representation |
---|---|
bin | 1100111011000011010… |
… | …1101101010010000110 |
3 | 210020001021100202102021 |
4 | 3032300311231102012 |
5 | 12114134102414342 |
6 | 245553505033354 |
7 | 22016422400605 |
oct | 3166065552206 |
9 | 706037322367 |
10 | 222010201222 |
11 | 86176a75147 |
12 | 3703a92585a |
13 | 17c21303494 |
14 | aa61359a3c |
15 | 5b9591a567 |
hex | 33b0d6d486 |
222010201222 has 8 divisors (see below), whose sum is σ = 333017478576. Its totient is φ = 111004375032.
The previous prime is 222010201219. The next prime is 222010201223. The reversal of 222010201222 is 222102010222.
222010201222 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 junction number, because it is equal to n+sod(n) for n = 222010201196 and 222010201205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (222010201223) 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, 185268 + ... + 691624.
It is an arithmetic number, because the mean of its divisors is an integer number (41627184822).
Almost surely, 2222010201222 is an apocalyptic number.
222010201222 is a deficient number, since it is larger than the sum of its proper divisors (111007277354).
222010201222 is a wasteful number, since it uses less digits than its factorization.
222010201222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 725582.
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 222010201222 its reverse (222102010222), we get a palindrome (444112211444).
The spelling of 222010201222 in words is "two hundred twenty-two billion, ten million, two hundred one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.175 sec. • engine limits •