Base | Representation |
---|---|
bin | 1011101101100100001… |
… | …1010100000100011001 |
3 | 201020100200011002001110 |
4 | 2323121003110010121 |
5 | 11244034231120441 |
6 | 232233513010533 |
7 | 20352112644315 |
oct | 2733103240431 |
9 | 636320132043 |
10 | 201210020121 |
11 | 783728a1230 |
12 | 32bb49b3a49 |
13 | 15c87c11406 |
14 | 9a4aa9cb45 |
15 | 53797ddb16 |
hex | 2ed90d4119 |
201210020121 has 32 divisors (see below), whose sum is σ = 308945825280. Its totient is φ = 115199884800.
The previous prime is 201210020119. The next prime is 201210020131. The reversal of 201210020121 is 121020012102.
It is not a de Polignac number, because 201210020121 - 21 = 201210020119 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201210020097 and 201210020106.
It is not an unprimeable number, because it can be changed into a prime (201210020131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 233215 + ... + 675876.
It is an arithmetic number, because the mean of its divisors is an integer number (9654557040).
Almost surely, 2201210020121 is an apocalyptic number.
It is an amenable number.
201210020121 is a deficient number, since it is larger than the sum of its proper divisors (107735805159).
201210020121 is a wasteful number, since it uses less digits than its factorization.
201210020121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 909477.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 201210020121 its reverse (121020012102), we get a palindrome (322230032223).
It can be divided in two parts, 2012100 and 20121, that multiplied together give a square (40485464100 = 2012102).
The spelling of 201210020121 in words is "two hundred one billion, two hundred ten million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •