Base | Representation |
---|---|
bin | 110010100000010011011010… |
… | …111001001101111010011101 |
3 | 1002010110200020002220010000112 |
4 | 302200103122321031322131 |
5 | 213103222231441042341 |
6 | 2104225310330335405 |
7 | 64533541132220624 |
oct | 6240233271157235 |
9 | 1063420202803015 |
10 | 222122201112221 |
11 | 648585508a54a3 |
12 | 20ab492b88a565 |
13 | 96c3059021cb7 |
14 | 3cbcab41246bb |
15 | 1aa2d95244aeb |
hex | ca04dae4de9d |
222122201112221 has 8 divisors (see below), whose sum is σ = 230184006967200. Its totient is φ = 214087223231280.
The previous prime is 222122201112199. The next prime is 222122201112281. The reversal of 222122201112221 is 122211102221222.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-222122201112221 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 (222122201112281) 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, 6706976651 + ... + 6707009768.
It is an arithmetic number, because the mean of its divisors is an integer number (28773000870900).
Almost surely, 2222122201112221 is an apocalyptic number.
It is an amenable number.
222122201112221 is a deficient number, since it is larger than the sum of its proper divisors (8061805854979).
222122201112221 is a wasteful number, since it uses less digits than its factorization.
222122201112221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13413987019.
The product of its (nonzero) digits is 512, while the sum is 23.
Adding to 222122201112221 its reverse (122211102221222), we get a palindrome (344333303333443).
The spelling of 222122201112221 in words is "two hundred twenty-two trillion, one hundred twenty-two billion, two hundred one million, one hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •