Base | Representation |
---|---|
bin | 110000000001011000010001… |
… | …110001100100100101101101 |
3 | 1000200210121202012220212021112 |
4 | 300001120101301210211231 |
5 | 210140304142111133401 |
6 | 2025104224213441405 |
7 | 62325525106503455 |
oct | 6001302161444555 |
9 | 1020717665825245 |
10 | 211201020021101 |
11 | 61327938891400 |
12 | 1b83020a340265 |
13 | 90b022b12c186 |
14 | 3a2228091ad65 |
15 | 1963c535063bb |
hex | c01611c6496d |
211201020021101 has 12 divisors (see below), whose sum is σ = 232793223616800. Its totient is φ = 191466105728040.
The previous prime is 211201020021067. The next prime is 211201020021241. The reversal of 211201020021101 is 101120020102112.
It is not a de Polignac number, because 211201020021101 - 222 = 211201015826797 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211201020021301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2430963491 + ... + 2431050368.
It is an arithmetic number, because the mean of its divisors is an integer number (19399435301400).
Almost surely, 2211201020021101 is an apocalyptic number.
It is an amenable number.
211201020021101 is a deficient number, since it is larger than the sum of its proper divisors (21592203595699).
211201020021101 is a wasteful number, since it uses less digits than its factorization.
211201020021101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4862014240 (or 4862014229 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 211201020021101 its reverse (101120020102112), we get a palindrome (312321040123213).
The spelling of 211201020021101 in words is "two hundred eleven trillion, two hundred one billion, twenty million, twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •