Base | Representation |
---|---|
bin | 101101101110100011010100… |
… | …010001011111000001011011 |
3 | 222101002000221001011101021020 |
4 | 231232203110101133001123 |
5 | 202330001023131134321 |
6 | 1551421100221213523 |
7 | 60234540533545455 |
oct | 5556432421370133 |
9 | 871060831141236 |
10 | 201111110021211 |
11 | 59097819718755 |
12 | 1a68081ba012a3 |
13 | 882a908a036b0 |
14 | 3793b8883b2d5 |
15 | 183b5650b34c6 |
hex | b6e8d445f05b |
201111110021211 has 8 divisors (see below), whose sum is σ = 288774927210000. Its totient is φ = 123760683089952.
The previous prime is 201111110021131. The next prime is 201111110021291. The reversal of 201111110021211 is 112120011111102.
It is an interprime number because it is at equal distance from previous prime (201111110021131) and next prime (201111110021291).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201111110021211 - 221 = 201111107924059 is a prime.
It is not an unprimeable number, because it can be changed into a prime (201111110021291) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2578347564336 + ... + 2578347564413.
It is an arithmetic number, because the mean of its divisors is an integer number (36096865901250).
Almost surely, 2201111110021211 is an apocalyptic number.
201111110021211 is a deficient number, since it is larger than the sum of its proper divisors (87663817188789).
201111110021211 is a wasteful number, since it uses less digits than its factorization.
201111110021211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5156695128765.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 201111110021211 its reverse (112120011111102), we get a palindrome (313231121132313).
The spelling of 201111110021211 in words is "two hundred one trillion, one hundred eleven billion, one hundred ten million, twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •