Base | Representation |
---|---|
bin | 101111111110101111101101… |
… | …010101101101001101111001 |
3 | 1000200011022120000122201010211 |
4 | 233332233231111231031321 |
5 | 210124323000122011301 |
6 | 2024445131533311121 |
7 | 62306456546603311 |
oct | 5776575525551571 |
9 | 1020138500581124 |
10 | 211020020110201 |
11 | 612680a7087385 |
12 | 1b8011159354a1 |
13 | 90991442ac193 |
14 | 3a175cddd8441 |
15 | 195e1ad138051 |
hex | bfebed56d379 |
211020020110201 has 2 divisors, whose sum is σ = 211020020110202. Its totient is φ = 211020020110200.
The previous prime is 211020020110121. The next prime is 211020020110213. The reversal of 211020020110201 is 102011020020112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 210450147610000 + 569872500201 = 14506900^2 + 754899^2 .
It is a cyclic number.
It is not a de Polignac number, because 211020020110201 - 213 = 211020020102009 is a prime.
It is not a weakly prime, because it can be changed into another prime (211020020110261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105510010055100 + 105510010055101.
It is an arithmetic number, because the mean of its divisors is an integer number (105510010055101).
Almost surely, 2211020020110201 is an apocalyptic number.
It is an amenable number.
211020020110201 is a deficient number, since it is larger than the sum of its proper divisors (1).
211020020110201 is an equidigital number, since it uses as much as digits as its factorization.
211020020110201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 211020020110201 its reverse (102011020020112), we get a palindrome (313031040130313).
The spelling of 211020020110201 in words is "two hundred eleven trillion, twenty billion, twenty million, one hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •