Base | Representation |
---|---|
bin | 110010100000001001111100… |
… | …000111001011010000000101 |
3 | 1002010102200221122012220001101 |
4 | 302200021330013023100011 |
5 | 213103040404334014341 |
6 | 2104220504231300101 |
7 | 64533030636546001 |
oct | 6240117407132005 |
9 | 1063380848186041 |
10 | 222112021001221 |
11 | 648541a745241a |
12 | 20ab296a51a631 |
13 | 96c20c5c22290 |
14 | 3cbc3ca0b9701 |
15 | 1aa299b65a831 |
hex | ca027c1cb405 |
222112021001221 has 32 divisors (see below), whose sum is σ = 242990020183680. Its totient is φ = 201781468348416.
The previous prime is 222112021001197. The next prime is 222112021001237. The reversal of 222112021001221 is 122100120211222.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-222112021001221 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 (222112021001281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7040654370 + ... + 7040685916.
It is an arithmetic number, because the mean of its divisors is an integer number (7593438130740).
Almost surely, 2222112021001221 is an apocalyptic number.
It is an amenable number.
222112021001221 is a deficient number, since it is larger than the sum of its proper divisors (20877999182459).
222112021001221 is a wasteful number, since it uses less digits than its factorization.
222112021001221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38773.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 222112021001221 its reverse (122100120211222), we get a palindrome (344212141212443).
The spelling of 222112021001221 in words is "two hundred twenty-two trillion, one hundred twelve billion, twenty-one million, one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •