Base | Representation |
---|---|
bin | 1011110000100101110… |
… | …0110110010000001111 |
3 | 201022110021001221122011 |
4 | 2330021130312100033 |
5 | 11302220114120421 |
6 | 232450241002051 |
7 | 20411202560242 |
oct | 2741134662017 |
9 | 638407057564 |
10 | 202022020111 |
11 | 7874a1888aa |
12 | 331a0923327 |
13 | 16087206292 |
14 | 9ac686d259 |
15 | 53c5c364e1 |
hex | 2f0973640f |
202022020111 has 2 divisors, whose sum is σ = 202022020112. Its totient is φ = 202022020110.
The previous prime is 202022020073. The next prime is 202022020147. The reversal of 202022020111 is 111020220202.
It is a happy number.
202022020111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 202022020111 - 221 = 202019922959 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 202022020091 and 202022020100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202022024111) 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 as a sum of consecutive naturals, namely, 101011010055 + 101011010056.
It is an arithmetic number, because the mean of its divisors is an integer number (101011010056).
Almost surely, 2202022020111 is an apocalyptic number.
202022020111 is a deficient number, since it is larger than the sum of its proper divisors (1).
202022020111 is an equidigital number, since it uses as much as digits as its factorization.
202022020111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 202022020111 its reverse (111020220202), we get a palindrome (313042240313).
The spelling of 202022020111 in words is "two hundred two billion, twenty-two million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •