Base | Representation |
---|---|
bin | 101101111101000110100010… |
… | …011111000100000100100001 |
3 | 222111121121211020111211200102 |
4 | 231331012202133010010201 |
5 | 202442341313014200001 |
6 | 1553504302414432145 |
7 | 60400016021151431 |
oct | 5575064237040441 |
9 | 874547736454612 |
10 | 202111002100001 |
11 | 59442881731865 |
12 | 1a802571802655 |
13 | 88a0ca7814117 |
14 | 37ca3207d02c1 |
15 | 185758710ce6b |
hex | b7d1a27c4121 |
202111002100001 has 2 divisors, whose sum is σ = 202111002100002. Its totient is φ = 202111002100000.
The previous prime is 202111002099997. The next prime is 202111002100003. The reversal of 202111002100001 is 100001200111202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 126403340069776 + 75707662030225 = 11242924^2 + 8701015^2 .
It is a cyclic number.
It is not a de Polignac number, because 202111002100001 - 22 = 202111002099997 is a prime.
Together with 202111002100003, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (202111002100003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101055501050000 + 101055501050001.
It is an arithmetic number, because the mean of its divisors is an integer number (101055501050001).
Almost surely, 2202111002100001 is an apocalyptic number.
It is an amenable number.
202111002100001 is a deficient number, since it is larger than the sum of its proper divisors (1).
202111002100001 is an equidigital number, since it uses as much as digits as its factorization.
202111002100001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 202111002100001 its reverse (100001200111202), we get a palindrome (302112202211203).
The spelling of 202111002100001 in words is "two hundred two trillion, one hundred eleven billion, two million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •