Base | Representation |
---|---|
bin | 101101101110100011001110… |
… | …010111110100110011100001 |
3 | 222101002000200010212121010202 |
4 | 231232203032113310303201 |
5 | 202330000322310120001 |
6 | 1551421042323234545 |
7 | 60234535222213265 |
oct | 5556431627646341 |
9 | 871060603777122 |
10 | 201111011020001 |
11 | 59097778849675 |
12 | 1a6807b2818a55 |
13 | 882a8c134c6b4 |
14 | 3793b7962a0a5 |
15 | 183b55b55996b |
hex | b6e8ce5f4ce1 |
201111011020001 has 2 divisors, whose sum is σ = 201111011020002. Its totient is φ = 201111011020000.
The previous prime is 201111011019973. The next prime is 201111011020009. The reversal of 201111011020001 is 100020110111102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 174942312683776 + 26168698336225 = 13226576^2 + 5115535^2 .
It is a cyclic number.
It is not a de Polignac number, because 201111011020001 - 210 = 201111011018977 is a prime.
It is not a weakly prime, because it can be changed into another prime (201111011020009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100555505510000 + 100555505510001.
It is an arithmetic number, because the mean of its divisors is an integer number (100555505510001).
Almost surely, 2201111011020001 is an apocalyptic number.
It is an amenable number.
201111011020001 is a deficient number, since it is larger than the sum of its proper divisors (1).
201111011020001 is an equidigital number, since it uses as much as digits as its factorization.
201111011020001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 201111011020001 its reverse (100020110111102), we get a palindrome (301131121131103).
The spelling of 201111011020001 in words is "two hundred one trillion, one hundred eleven billion, eleven million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •