Base | Representation |
---|---|
bin | 110010000001011101111101… |
… | …111101101101100000111101 |
3 | 1001211222002202212222122102121 |
4 | 302001131331331231200331 |
5 | 212314013100110212341 |
6 | 2055524030242322541 |
7 | 64224464650452364 |
oct | 6201357575554075 |
9 | 1054862685878377 |
10 | 220003223132221 |
11 | 6411092aa93321 |
12 | 20812122359451 |
13 | 959b2a4250439 |
14 | 3c482d9d6c7db |
15 | 1a67bc6d924d1 |
hex | c8177df6d83d |
220003223132221 has 8 divisors (see below), whose sum is σ = 231582610702080. Its totient is φ = 208423862618688.
The previous prime is 220003223132219. The next prime is 220003223132249. The reversal of 220003223132221 is 122231322300022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 220003223132221 - 21 = 220003223132219 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220003223132291) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11141940 + ... + 23751826.
It is an arithmetic number, because the mean of its divisors is an integer number (28947826337760).
Almost surely, 2220003223132221 is an apocalyptic number.
It is an amenable number.
220003223132221 is a deficient number, since it is larger than the sum of its proper divisors (11579387569859).
220003223132221 is a wasteful number, since it uses less digits than its factorization.
220003223132221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13528163.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 220003223132221 its reverse (122231322300022), we get a palindrome (342234545432243).
The spelling of 220003223132221 in words is "two hundred twenty trillion, three billion, two hundred twenty-three million, one hundred thirty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •