Base | Representation |
---|---|
bin | 101101101101001111100101… |
… | …010110011100010001001111 |
3 | 222100202102212012202212020222 |
4 | 231231033211112130101033 |
5 | 202322012410232020421 |
6 | 1551311510533101555 |
7 | 60225205534053410 |
oct | 5555174526342117 |
9 | 870672765685228 |
10 | 201021202220111 |
11 | 5906268204aaa9 |
12 | 1a667309a878bb |
13 | 88222ab0231a0 |
14 | 378d699c9d807 |
15 | 1839051d99cab |
hex | b6d3e559c44f |
201021202220111 has 32 divisors (see below), whose sum is σ = 262076284753920. Its totient is φ = 149629873430016.
The previous prime is 201021202220087. The next prime is 201021202220129. The reversal of 201021202220111 is 111022202120102.
It is not a de Polignac number, because 201021202220111 - 218 = 201021201957967 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a self number, because there is not a number n which added to its sum of digits gives 201021202220111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201021202220011) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 24158951 + ... + 31395816.
It is an arithmetic number, because the mean of its divisors is an integer number (8189883898560).
Almost surely, 2201021202220111 is an apocalyptic number.
201021202220111 is a deficient number, since it is larger than the sum of its proper divisors (61055082533809).
201021202220111 is a wasteful number, since it uses less digits than its factorization.
201021202220111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55557143.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 201021202220111 its reverse (111022202120102), we get a palindrome (312043404340213).
The spelling of 201021202220111 in words is "two hundred one trillion, twenty-one billion, two hundred two million, two hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •