Base | Representation |
---|---|
bin | 101101101110100010011110… |
… | …101100110000101111100101 |
3 | 222101001221121101212122010121 |
4 | 231232202132230300233211 |
5 | 202324442203031431041 |
6 | 1551420431112321541 |
7 | 60234506340655402 |
oct | 5556423654605745 |
9 | 871057541778117 |
10 | 201110211202021 |
11 | 590973a8322580 |
12 | 1a68060a9a32b1 |
13 | 882a7c4731614 |
14 | 3793b0130b2a9 |
15 | 183b51121b7d1 |
hex | b6e89eb30be5 |
201110211202021 has 16 divisors (see below), whose sum is σ = 221567537059776. Its totient is φ = 181015354000000.
The previous prime is 201110211202003. The next prime is 201110211202027. The reversal of 201110211202021 is 120202112011102.
It is a cyclic number.
It is not a de Polignac number, because 201110211202021 - 215 = 201110211169253 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201110211201986 and 201110211202004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201110211202027) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 108414921 + ... + 110254321.
It is an arithmetic number, because the mean of its divisors is an integer number (13847971066236).
Almost surely, 2201110211202021 is an apocalyptic number.
It is an amenable number.
201110211202021 is a deficient number, since it is larger than the sum of its proper divisors (20457325857755).
201110211202021 is a wasteful number, since it uses less digits than its factorization.
201110211202021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1937924.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 201110211202021 its reverse (120202112011102), we get a palindrome (321312323213123).
The spelling of 201110211202021 in words is "two hundred one trillion, one hundred ten billion, two hundred eleven million, two hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •