Base | Representation |
---|---|
bin | 1011110001010101000… |
… | …0111010111011010000 |
3 | 201022222002000112220221 |
4 | 2330111100322323100 |
5 | 11303121334020422 |
6 | 232522041042424 |
7 | 20416130336641 |
oct | 2742520727320 |
9 | 638862015827 |
10 | 202220220112 |
11 | 78841051459 |
12 | 33237186414 |
13 | 160b92b01a1 |
14 | 9b04d036c8 |
15 | 53d83373c7 |
hex | 2f1543aed0 |
202220220112 has 20 divisors (see below), whose sum is σ = 392453611396. Its totient is φ = 100941868800.
The previous prime is 202220220107. The next prime is 202220220119. The reversal of 202220220112 is 211022022202.
202220220112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 104628959296 + 97591260816 = 323464^2 + 312396^2 .
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202220220119) 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, 10505163 + ... + 10524394.
Almost surely, 2202220220112 is an apocalyptic number.
It is an amenable number.
202220220112 is a deficient number, since it is larger than the sum of its proper divisors (190233391284).
202220220112 is a wasteful number, since it uses less digits than its factorization.
202220220112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21030166 (or 21030160 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 202220220112 its reverse (211022022202), we get a palindrome (413242242314).
The spelling of 202220220112 in words is "two hundred two billion, two hundred twenty million, two hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •