Base | Representation |
---|---|
bin | 101111111111111011001001… |
… | …010011110101110111101001 |
3 | 1000200110001122001021110210111 |
4 | 233333323021103311313221 |
5 | 210132134342111121301 |
6 | 2024550245250414321 |
7 | 62315355032512363 |
oct | 5777731123656751 |
9 | 1020401561243714 |
10 | 211101020020201 |
11 | 61299492455663 |
12 | 1b8149605913a1 |
13 | 90a398261c1cc |
14 | 3a1b4b5899d33 |
15 | 196134e2bb551 |
hex | bffec94f5de9 |
211101020020201 has 4 divisors (see below), whose sum is σ = 211193324797312. Its totient is φ = 211008715243092.
The previous prime is 211101020020193. The next prime is 211101020020259. The reversal of 211101020020201 is 102020020101112.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 211101020020201 - 23 = 211101020020193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211101020020271) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 46152385125 + ... + 46152389698.
It is an arithmetic number, because the mean of its divisors is an integer number (52798331199328).
Almost surely, 2211101020020201 is an apocalyptic number.
It is an amenable number.
211101020020201 is a deficient number, since it is larger than the sum of its proper divisors (92304777111).
211101020020201 is an equidigital number, since it uses as much as digits as its factorization.
211101020020201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92304777110.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 211101020020201 its reverse (102020020101112), we get a palindrome (313121040121313).
The spelling of 211101020020201 in words is "two hundred eleven trillion, one hundred one billion, twenty million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •