Base | Representation |
---|---|
bin | 110010010011001011011000… |
… | …000110000101010110100110 |
3 | 1002000021110000212101221011011 |
4 | 302103023120012011112212 |
5 | 212443432443010134342 |
6 | 2102255054552332434 |
7 | 64411430025025540 |
oct | 6223133006052646 |
9 | 1060243025357134 |
10 | 221220211021222 |
11 | 6453aa67a168a6 |
12 | 20989b610a411a |
13 | 9658c9017ab6a |
14 | 3c8b188702690 |
15 | 1a896a3161717 |
hex | c932d81855a6 |
221220211021222 has 16 divisors (see below), whose sum is σ = 382989445957152. Its totient is φ = 93869962243200.
The previous prime is 221220211021213. The next prime is 221220211021231. The reversal of 221220211021222 is 222120112022122.
It is an interprime number because it is at equal distance from previous prime (221220211021213) and next prime (221220211021231).
It is a super-2 number, since 2×2212202110212222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 221220211021193 and 221220211021202.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 78224967123 + ... + 78224969950.
It is an arithmetic number, because the mean of its divisors is an integer number (23936840372322).
Almost surely, 2221220211021222 is an apocalyptic number.
221220211021222 is a deficient number, since it is larger than the sum of its proper divisors (161769234935930).
221220211021222 is a wasteful number, since it uses less digits than its factorization.
221220211021222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156449937183.
The product of its (nonzero) digits is 512, while the sum is 22.
Adding to 221220211021222 its reverse (222120112022122), we get a palindrome (443340323043344).
The spelling of 221220211021222 in words is "two hundred twenty-one trillion, two hundred twenty billion, two hundred eleven million, twenty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •