Base | Representation |
---|---|
bin | 101101111101001111110110… |
… | …100001101111000011110111 |
3 | 222111122120122011010110120221 |
4 | 231331033312201233003313 |
5 | 202443022303004133421 |
6 | 1553513034555435211 |
7 | 60400521565114405 |
oct | 5575176641570367 |
9 | 874576564113527 |
10 | 202121002021111 |
11 | 594470433a2578 |
12 | 1a8044a2755b07 |
13 | 88a1c0c4a46c4 |
14 | 37ca9cc932475 |
15 | 185796eea2841 |
hex | b7d3f686f0f7 |
202121002021111 has 8 divisors (see below), whose sum is σ = 206474282807040. Its totient is φ = 197769922649208.
The previous prime is 202121002021073. The next prime is 202121002021157. The reversal of 202121002021111 is 111120200121202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 202121002021111 - 227 = 202120867803383 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202121002081111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 550167901 + ... + 550535158.
It is an arithmetic number, because the mean of its divisors is an integer number (25809285350880).
Almost surely, 2202121002021111 is an apocalyptic number.
202121002021111 is a deficient number, since it is larger than the sum of its proper divisors (4353280785929).
202121002021111 is a wasteful number, since it uses less digits than its factorization.
202121002021111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1100707013.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 202121002021111 its reverse (111120200121202), we get a palindrome (313241202142313).
The spelling of 202121002021111 in words is "two hundred two trillion, one hundred twenty-one billion, two million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •