Base | Representation |
---|---|
bin | 1011101100110111011… |
… | …0000101001101100110 |
3 | 201012212120100202201011 |
4 | 2323031312011031212 |
5 | 11243143113031042 |
6 | 232203115052434 |
7 | 20344340552512 |
oct | 2731566051546 |
9 | 635776322634 |
10 | 201022002022 |
11 | 78286752476 |
12 | 32b61a4111a |
13 | 15c57c90aba |
14 | 9a2db19142 |
15 | 536804ea17 |
hex | 2ecdd85366 |
201022002022 has 4 divisors (see below), whose sum is σ = 301533003036. Its totient is φ = 100511001010.
The previous prime is 201022002007. The next prime is 201022002023. The reversal of 201022002022 is 220200220102.
201022002022 is digitally balanced in base 3, 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 Smith number, since the sum of its digits (13) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 201022001993 and 201022002011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201022002023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50255500504 + ... + 50255500507.
It is an arithmetic number, because the mean of its divisors is an integer number (75383250759).
Almost surely, 2201022002022 is an apocalyptic number.
201022002022 is a deficient number, since it is larger than the sum of its proper divisors (100511001014).
201022002022 is a wasteful number, since it uses less digits than its factorization.
201022002022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100511001013.
The product of its (nonzero) digits is 64, while the sum is 13.
Adding to 201022002022 its reverse (220200220102), we get a palindrome (421222222124).
The spelling of 201022002022 in words is "two hundred one billion, twenty-two million, two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •