Base | Representation |
---|---|
bin | 1011110000100101110… |
… | …0110100000011011110 |
3 | 201022110021001111021111 |
4 | 2330021130310003132 |
5 | 11302220113323402 |
6 | 232450240452234 |
7 | 20411202522052 |
oct | 2741134640336 |
9 | 638407044244 |
10 | 202022011102 |
11 | 7874a18205a |
12 | 331a091a07a |
13 | 16087202152 |
14 | 9ac6869c62 |
15 | 53c5c339d7 |
hex | 2f097340de |
202022011102 has 4 divisors (see below), whose sum is σ = 303033016656. Its totient is φ = 101011005550.
The previous prime is 202022011069. The next prime is 202022011141. The reversal of 202022011102 is 201110220202.
It is a happy number.
202022011102 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 super-2 number, since 2×2020220111022 (a number of 23 digits) contains 22 as substring.
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, 50505502774 + ... + 50505502777.
It is an arithmetic number, because the mean of its divisors is an integer number (75758254164).
Almost surely, 2202022011102 is an apocalyptic number.
202022011102 is a deficient number, since it is larger than the sum of its proper divisors (101011005554).
202022011102 is a wasteful number, since it uses less digits than its factorization.
202022011102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101011005553.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 202022011102 its reverse (201110220202), we get a palindrome (403132231304).
It can be divided in two parts, 20202 and 2011102, that multiplied together give a palindrome (40628282604).
The spelling of 202022011102 in words is "two hundred two billion, twenty-two million, eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •