Base | Representation |
---|---|
bin | 1011110000100011101… |
… | …1010001110100001101 |
3 | 201022102122111212022011 |
4 | 2330020323101310031 |
5 | 11302210341020414 |
6 | 232445324221221 |
7 | 20411035016251 |
oct | 2741073216415 |
9 | 638378455264 |
10 | 202013220109 |
11 | 78745218278 |
12 | 3319999a811 |
13 | 1608544498c |
14 | 9ac561c261 |
15 | 53c5098dc4 |
hex | 2f08ed1d0d |
202013220109 has 16 divisors (see below), whose sum is σ = 216339057792. Its totient is φ = 188175955968.
The previous prime is 202013220077. The next prime is 202013220127. The reversal of 202013220109 is 901022310202.
202013220109 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 202013220109 - 25 = 202013220077 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 202013220109.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202013220169) 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 15 ways as a sum of consecutive naturals, for example, 30237 + ... + 636349.
It is an arithmetic number, because the mean of its divisors is an integer number (13521191112).
Almost surely, 2202013220109 is an apocalyptic number.
It is an amenable number.
202013220109 is a deficient number, since it is larger than the sum of its proper divisors (14325837683).
202013220109 is a wasteful number, since it uses less digits than its factorization.
202013220109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 606516.
The product of its (nonzero) digits is 432, while the sum is 22.
The spelling of 202013220109 in words is "two hundred two billion, thirteen million, two hundred twenty thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •