Base | Representation |
---|---|
bin | 1001000110101100000011… |
… | …10010101011000101110101 |
3 | 2121212222202022111210102120 |
4 | 10203112001302223011311 |
5 | 10111011022122024341 |
6 | 110325310224030153 |
7 | 4134320354020653 |
oct | 443260162530565 |
9 | 77788668453376 |
10 | 20021020111221 |
11 | 64199599a6788 |
12 | 22b425b162359 |
13 | b22c8811a77c |
14 | 4d3045c07dd3 |
15 | 24abd5457066 |
hex | 123581cab175 |
20021020111221 has 16 divisors (see below), whose sum is σ = 27147372705600. Its totient is φ = 13121010908928.
The previous prime is 20021020111207. The next prime is 20021020111223. The reversal of 20021020111221 is 12211102012002.
It is not a de Polignac number, because 20021020111221 - 221 = 20021018014069 is a prime.
It is a super-2 number, since 2×200210201112212 (a number of 27 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 20021020111221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20021020111223) 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, 24489165 + ... + 25293501.
It is an arithmetic number, because the mean of its divisors is an integer number (1696710794100).
Almost surely, 220021020111221 is an apocalyptic number.
It is an amenable number.
20021020111221 is a deficient number, since it is larger than the sum of its proper divisors (7126352594379).
20021020111221 is a wasteful number, since it uses less digits than its factorization.
20021020111221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 945028.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 20021020111221 its reverse (12211102012002), we get a palindrome (32232122123223).
The spelling of 20021020111221 in words is "twenty trillion, twenty-one billion, twenty million, one hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •