Base | Representation |
---|---|
bin | 1100111011000001011… |
… | …1001100010110100110 |
3 | 210020000201022100120121 |
4 | 3032300113030112212 |
5 | 12114130030431042 |
6 | 245553021352154 |
7 | 22016264403406 |
oct | 3166027142646 |
9 | 706021270517 |
10 | 222002202022 |
11 | 86172501237 |
12 | 3703810865a |
13 | 17c1c762523 |
14 | aa60276806 |
15 | 5b94d8a367 |
hex | 33b05cc5a6 |
222002202022 has 4 divisors (see below), whose sum is σ = 333003303036. Its totient is φ = 111001101010.
The previous prime is 222002202011. The next prime is 222002202053. The reversal of 222002202022 is 220202200222.
It is a happy number.
222002202022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a junction number, because it is equal to n+sod(n) for n = 222002201987 and 222002202005.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 55500550504 + ... + 55500550507.
It is an arithmetic number, because the mean of its divisors is an integer number (83250825759).
Almost surely, 2222002202022 is an apocalyptic number.
222002202022 is a deficient number, since it is larger than the sum of its proper divisors (111001101014).
222002202022 is a wasteful number, since it uses less digits than its factorization.
222002202022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111001101013.
The product of its (nonzero) digits is 256, while the sum is 16.
Adding to 222002202022 its reverse (220202200222), we get a palindrome (442204402244).
It can be divided in two parts, 22200 and 2202022, that added together give a palindrome (2224222).
The spelling of 222002202022 in words is "two hundred twenty-two billion, two million, two hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •