Base | Representation |
---|---|
bin | 110010000001101101101101… |
… | …001010010101111110111101 |
3 | 1001212000201101112111100202021 |
4 | 302001231231022111332331 |
5 | 212314302202000201341 |
6 | 2055535503120400141 |
7 | 64225633465016251 |
oct | 6201555512257675 |
9 | 1055021345440667 |
10 | 220020121100221 |
11 | 641180114a2832 |
12 | 20815459476051 |
13 | 959ca6806b180 |
14 | 3c4906028c261 |
15 | 1a683656129d1 |
hex | c81b6d295fbd |
220020121100221 has 16 divisors (see below), whose sum is σ = 241994924982720. Its totient is φ = 198796319003520.
The previous prime is 220020121100173. The next prime is 220020121100261. The reversal of 220020121100221 is 122001121020022.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 220020121100221 - 219 = 220020120575933 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 220020121100195 and 220020121100204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220020121100261) 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, 615396495 + ... + 615753916.
It is an arithmetic number, because the mean of its divisors is an integer number (15124682811420).
Almost surely, 2220020121100221 is an apocalyptic number.
It is an amenable number.
220020121100221 is a deficient number, since it is larger than the sum of its proper divisors (21974803882499).
220020121100221 is a wasteful number, since it uses less digits than its factorization.
220020121100221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1231150716.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 220020121100221 its reverse (122001121020022), we get a palindrome (342021242120243).
The spelling of 220020121100221 in words is "two hundred twenty trillion, twenty billion, one hundred twenty-one million, one hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •