Base | Representation |
---|---|
bin | 101101101101000111001100… |
… | …110110010110101111110111 |
3 | 222100201120121220210201212122 |
4 | 231231013030312112233313 |
5 | 202321340442003033421 |
6 | 1551303421434310155 |
7 | 60224436506612000 |
oct | 5555071466265767 |
9 | 870646556721778 |
10 | 201012201221111 |
11 | 59059883237255 |
12 | 1a66561758835b |
13 | 88214a52b3287 |
14 | 378d0846a81a7 |
15 | 1838bc6a722ab |
hex | b6d1ccd96bf7 |
201012201221111 has 32 divisors (see below), whose sum is σ = 246983427225600. Its totient is φ = 163204985002752.
The previous prime is 201012201221021. The next prime is 201012201221131. The reversal of 201012201221111 is 111122102210102.
It is not a de Polignac number, because 201012201221111 - 222 = 201012197026807 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 201012201221111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201012201221131) 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, 122877050 + ... + 124502183.
It is an arithmetic number, because the mean of its divisors is an integer number (7718232100800).
Almost surely, 2201012201221111 is an apocalyptic number.
201012201221111 is a deficient number, since it is larger than the sum of its proper divisors (45971226004489).
201012201221111 is a wasteful number, since it uses less digits than its factorization.
201012201221111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 247379380 (or 247379366 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 201012201221111 its reverse (111122102210102), we get a palindrome (312134303431213).
The spelling of 201012201221111 in words is "two hundred one trillion, twelve billion, two hundred one million, two hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •