Base | Representation |
---|---|
bin | 1011110000111101001… |
… | …0101100010000011110 |
3 | 201022201002110220121112 |
4 | 2330033102230100132 |
5 | 11302420211133042 |
6 | 232504101302022 |
7 | 20413502555213 |
oct | 2741722542036 |
9 | 638632426545 |
10 | 202120021022 |
11 | 7879a534397 |
12 | 33209704912 |
13 | 160a15c9b9a |
14 | 9ad589db0a |
15 | 53ce643982 |
hex | 2f0f4ac41e |
202120021022 has 4 divisors (see below), whose sum is σ = 303180031536. Its totient is φ = 101060010510.
The previous prime is 202120020959. The next prime is 202120021057. The reversal of 202120021022 is 220120021202.
202120021022 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, and also an emirpimes, since its reverse is a distinct semiprime: 220120021202 = 2 ⋅110060010601.
It is a junction number, because it is equal to n+sod(n) for n = 202120020988 and 202120021006.
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, 50530005254 + ... + 50530005257.
It is an arithmetic number, because the mean of its divisors is an integer number (75795007884).
Almost surely, 2202120021022 is an apocalyptic number.
202120021022 is a deficient number, since it is larger than the sum of its proper divisors (101060010514).
202120021022 is a wasteful number, since it uses less digits than its factorization.
202120021022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101060010513.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 202120021022 its reverse (220120021202), we get a palindrome (422240042224).
The spelling of 202120021022 in words is "two hundred two billion, one hundred twenty million, twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •