Base | Representation |
---|---|
bin | 101101101110100011011001… |
… | …101001100100011111001101 |
3 | 222101002001011022220000022002 |
4 | 231232203121221210133031 |
5 | 202330001214224034013 |
6 | 1551421113202402045 |
7 | 60234543010333136 |
oct | 5556433151443715 |
9 | 871061138800262 |
10 | 201111200221133 |
11 | 59097865626244 |
12 | 1a680846060325 |
13 | 882a9215c5627 |
14 | 3793b967dac8d |
15 | 183b56ce7e358 |
hex | b6e8d9a647cd |
201111200221133 has 2 divisors, whose sum is σ = 201111200221134. Its totient is φ = 201111200221132.
The previous prime is 201111200221121. The next prime is 201111200221189. The reversal of 201111200221133 is 331122002111102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 108284565444169 + 92826634776964 = 10405987^2 + 9634658^2 .
It is a cyclic number.
It is not a de Polignac number, because 201111200221133 - 24 = 201111200221117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201111200221033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100555600110566 + 100555600110567.
It is an arithmetic number, because the mean of its divisors is an integer number (100555600110567).
Almost surely, 2201111200221133 is an apocalyptic number.
It is an amenable number.
201111200221133 is a deficient number, since it is larger than the sum of its proper divisors (1).
201111200221133 is an equidigital number, since it uses as much as digits as its factorization.
201111200221133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 201111200221133 its reverse (331122002111102), we get a palindrome (532233202332235).
The spelling of 201111200221133 in words is "two hundred one trillion, one hundred eleven billion, two hundred million, two hundred twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •