Base | Representation |
---|---|
bin | 110010000011001010110100… |
… | …011111100110010000000101 |
3 | 1001212101021110101101111100221 |
4 | 302003022310133212100011 |
5 | 212322421432114231041 |
6 | 2100053440124304341 |
7 | 64236103221350362 |
oct | 6203126437462005 |
9 | 1055337411344327 |
10 | 220120102102021 |
11 | 64156458132240 |
12 | 208309009a20b1 |
13 | 95a930c958474 |
14 | 3c4dc269a5469 |
15 | 1a6ac67d482d1 |
hex | c832b47e6405 |
220120102102021 has 16 divisors (see below), whose sum is σ = 251759042339328. Its totient is φ = 190501633753200.
The previous prime is 220120102102009. The next prime is 220120102102037. The reversal of 220120102102021 is 120201201021022.
It is a happy number.
It is not a de Polignac number, because 220120102102021 - 247 = 79382613746693 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220120102101986 and 220120102102004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220120102102081) 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, 2061652611 + ... + 2061759376.
It is an arithmetic number, because the mean of its divisors is an integer number (15734940146208).
Almost surely, 2220120102102021 is an apocalyptic number.
It is an amenable number.
220120102102021 is a deficient number, since it is larger than the sum of its proper divisors (31638940237307).
220120102102021 is a wasteful number, since it uses less digits than its factorization.
220120102102021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4123412232.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 220120102102021 its reverse (120201201021022), we get a palindrome (340321303123043).
The spelling of 220120102102021 in words is "two hundred twenty trillion, one hundred twenty billion, one hundred two million, one hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •