Base | Representation |
---|---|
bin | 1011101100110100100… |
… | …1000110100011001110 |
3 | 201012211202011201111110 |
4 | 2323031021012203032 |
5 | 11243132103223042 |
6 | 232202014232450 |
7 | 20344135413435 |
oct | 2731511064316 |
9 | 635752151443 |
10 | 201010211022 |
11 | 78280029745 |
12 | 32b59ab5726 |
13 | 15c556c2c8a |
14 | 9a2c32a11c |
15 | 5366ec109c |
hex | 2ecd2468ce |
201010211022 has 16 divisors (see below), whose sum is σ = 412885839312. Its totient is φ = 65192500800.
The previous prime is 201010210987. The next prime is 201010211113. The reversal of 201010211022 is 220112010102.
201010211022 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 = 201010210989 and 201010211007.
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 7 ways as a sum of consecutive naturals, for example, 452725479 + ... + 452725922.
It is an arithmetic number, because the mean of its divisors is an integer number (25805364957).
Almost surely, 2201010211022 is an apocalyptic number.
201010211022 is an abundant number, since it is smaller than the sum of its proper divisors (211875628290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201010211022 is a wasteful number, since it uses less digits than its factorization.
201010211022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 905451443.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 201010211022 its reverse (220112010102), we get a palindrome (421122221124).
The spelling of 201010211022 in words is "two hundred one billion, ten million, two hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •