Base | Representation |
---|---|
bin | 1011110000100101100… |
… | …1010101111000111000 |
3 | 201022110012100021000011 |
4 | 2330021121111320320 |
5 | 11302214400213422 |
6 | 232450205151304 |
7 | 20411162012035 |
oct | 2741131257070 |
9 | 638405307004 |
10 | 202021101112 |
11 | 787497103a6 |
12 | 331a055b534 |
13 | 16086c73bac |
14 | 9ac66b038c |
15 | 53c5b04077 |
hex | 2f09655e38 |
202021101112 has 32 divisors (see below), whose sum is σ = 388839038400. Its totient is φ = 98365722624.
The previous prime is 202021101067. The next prime is 202021101119. The reversal of 202021101112 is 211101120202.
202021101112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 202021101092 and 202021101101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202021101119) 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 7 ways as a sum of consecutive naturals, for example, 2143273 + ... + 2235544.
It is an arithmetic number, because the mean of its divisors is an integer number (12151219950).
Almost surely, 2202021101112 is an apocalyptic number.
It is an amenable number.
202021101112 is a deficient number, since it is larger than the sum of its proper divisors (186817937288).
202021101112 is a wasteful number, since it uses less digits than its factorization.
202021101112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4378975 (or 4378971 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 202021101112 its reverse (211101120202), we get a palindrome (413122221314).
The spelling of 202021101112 in words is "two hundred two billion, twenty-one million, one hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •