Base | Representation |
---|---|
bin | 101101101111110110000111… |
… | …001100010101110000000101 |
3 | 222101101112101201022010220012 |
4 | 231233312013030111300011 |
5 | 202332430110322440401 |
6 | 1551530001544520005 |
7 | 60244135560566141 |
oct | 5557660714256005 |
9 | 871345351263805 |
10 | 201200011140101 |
11 | 5912149a019136 |
12 | 1a695ab0780005 |
13 | 8836105c7735c |
14 | 37981bd80c221 |
15 | 183da19c2a8bb |
hex | b6fd87315c05 |
201200011140101 has 2 divisors, whose sum is σ = 201200011140102. Its totient is φ = 201200011140100.
The previous prime is 201200011140083. The next prime is 201200011140103. The reversal of 201200011140101 is 101041110002102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 192321840040225 + 8878171099876 = 13868015^2 + 2979626^2 .
It is a cyclic number.
It is not a de Polignac number, because 201200011140101 - 234 = 201182831270917 is a prime.
Together with 201200011140103, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201200011140103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100600005570050 + 100600005570051.
It is an arithmetic number, because the mean of its divisors is an integer number (100600005570051).
Almost surely, 2201200011140101 is an apocalyptic number.
It is an amenable number.
201200011140101 is a deficient number, since it is larger than the sum of its proper divisors (1).
201200011140101 is an equidigital number, since it uses as much as digits as its factorization.
201200011140101 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 14.
Adding to 201200011140101 its reverse (101041110002102), we get a palindrome (302241121142203).
The spelling of 201200011140101 in words is "two hundred one trillion, two hundred billion, eleven million, one hundred forty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •