Base | Representation |
---|---|
bin | 101101101110100010011110… |
… | …000010110101100111110001 |
3 | 222101001221120122012021121001 |
4 | 231232202132002311213301 |
5 | 202324442142223240303 |
6 | 1551420430041002001 |
7 | 60234506145363364 |
oct | 5556423602654761 |
9 | 871057518167531 |
10 | 201110200211953 |
11 | 590973a20a657a |
12 | 1a680607183301 |
13 | 882a7c2384216 |
14 | 3793adda8a0db |
15 | 183b51029a31d |
hex | b6e89e0b59f1 |
201110200211953 has 2 divisors, whose sum is σ = 201110200211954. Its totient is φ = 201110200211952.
The previous prime is 201110200211951. The next prime is 201110200212029. The reversal of 201110200211953 is 359112002011102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 158773406683024 + 42336793528929 = 12600532^2 + 6506673^2 .
It is a cyclic number.
It is not a de Polignac number, because 201110200211953 - 21 = 201110200211951 is a prime.
It is a super-2 number, since 2×2011102002119532 (a number of 29 digits) contains 22 as substring.
Together with 201110200211951, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (201110200211951) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100555100105976 + 100555100105977.
It is an arithmetic number, because the mean of its divisors is an integer number (100555100105977).
Almost surely, 2201110200211953 is an apocalyptic number.
It is an amenable number.
201110200211953 is a deficient number, since it is larger than the sum of its proper divisors (1).
201110200211953 is an equidigital number, since it uses as much as digits as its factorization.
201110200211953 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1080, while the sum is 28.
The spelling of 201110200211953 in words is "two hundred one trillion, one hundred ten billion, two hundred million, two hundred eleven thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •