Base | Representation |
---|---|
bin | 1011110000111000111… |
… | …0000001111110000110 |
3 | 201022122211121110121220 |
4 | 2330032032001332012 |
5 | 11302401104201042 |
6 | 232502215421210 |
7 | 20413163562045 |
oct | 2741616017606 |
9 | 638584543556 |
10 | 202102022022 |
11 | 7879036048a |
12 | 33203684806 |
13 | 1609a9674a4 |
14 | 9ad333655c |
15 | 53ccc8a8ec |
hex | 2f0e381f86 |
202102022022 has 16 divisors (see below), whose sum is σ = 410830340592. Its totient is φ = 66262957920.
The previous prime is 202102022021. The next prime is 202102022027. The reversal of 202102022022 is 220220201202.
202102022022 is digitally balanced in base 2 and base 7, because in such bases 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 = 202102021992 and 202102022010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202102022021) 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, 276095293 + ... + 276096024.
It is an arithmetic number, because the mean of its divisors is an integer number (25676896287).
Almost surely, 2202102022022 is an apocalyptic number.
202102022022 is an abundant number, since it is smaller than the sum of its proper divisors (208728318570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202102022022 is a wasteful number, since it uses less digits than its factorization.
202102022022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 552191383.
The product of its (nonzero) digits is 128, while the sum is 15.
Adding to 202102022022 its reverse (220220201202), we get a palindrome (422322223224).
The spelling of 202102022022 in words is "two hundred two billion, one hundred two million, twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •