Base | Representation |
---|---|
bin | 1011110000100101100… |
… | …1101110100001100110 |
3 | 201022110012112101102120 |
4 | 2330021121232201212 |
5 | 11302214411431042 |
6 | 232450211250410 |
7 | 20411162612163 |
oct | 2741131564146 |
9 | 638405471376 |
10 | 202021202022 |
11 | 7874977a1a2 |
12 | 331a05a9a06 |
13 | 16086caaac3 |
14 | 9ac66d906a |
15 | 53c5b23dec |
hex | 2f0966e866 |
202021202022 has 32 divisors (see below), whose sum is σ = 406035940320. Its totient is φ = 67008802560.
The previous prime is 202021201999. The next prime is 202021202051. The reversal of 202021202022 is 220202120202.
202021202022 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 = 202021201992 and 202021202010.
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 in 15 ways as a sum of consecutive naturals, for example, 1154104 + ... + 1317572.
It is an arithmetic number, because the mean of its divisors is an integer number (12688623135).
Almost surely, 2202021202022 is an apocalyptic number.
202021202022 is an abundant number, since it is smaller than the sum of its proper divisors (204014738298).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202021202022 is a wasteful number, since it uses less digits than its factorization.
202021202022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164488.
The product of its (nonzero) digits is 128, while the sum is 15.
Adding to 202021202022 its reverse (220202120202), we get a palindrome (422223322224).
It can be divided in two parts, 20202120202 and 2, that multiplied together give a palindrome (40404240404).
The spelling of 202021202022 in words is "two hundred two billion, twenty-one million, two hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •