Base | Representation |
---|---|
bin | 101101111101001111110110… |
… | …100010011011001111111111 |
3 | 222111122120122011110122212122 |
4 | 231331033312202123033333 |
5 | 202443022303030431421 |
6 | 1553513035003353155 |
7 | 60400521566500166 |
oct | 5575176642331777 |
9 | 874576564418778 |
10 | 202121002202111 |
11 | 59447043506563 |
12 | 1a8044a28227bb |
13 | 88a1c0c538bc5 |
14 | 37ca9cc97c3dd |
15 | 185796eedb2ab |
hex | b7d3f689b3ff |
202121002202111 has 2 divisors, whose sum is σ = 202121002202112. Its totient is φ = 202121002202110.
The previous prime is 202121002202087. The next prime is 202121002202123. The reversal of 202121002202111 is 111202200121202.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 202121002202111 - 246 = 131752258024447 is a prime.
It is a super-2 number, since 2×2021210022021112 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 202121002202111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202121002204111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101060501101055 + 101060501101056.
It is an arithmetic number, because the mean of its divisors is an integer number (101060501101056).
Almost surely, 2202121002202111 is an apocalyptic number.
202121002202111 is a deficient number, since it is larger than the sum of its proper divisors (1).
202121002202111 is an equidigital number, since it uses as much as digits as its factorization.
202121002202111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 202121002202111 its reverse (111202200121202), we get a palindrome (313323202323313).
The spelling of 202121002202111 in words is "two hundred two trillion, one hundred twenty-one billion, two million, two hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •