Base | Representation |
---|---|
bin | 110010100001100110000111… |
… | …110010010111010111011101 |
3 | 1002010210011102201202220120201 |
4 | 302201212013302113113131 |
5 | 213111201112241321341 |
6 | 2104334154042543501 |
7 | 64543133520641341 |
oct | 6241460762272735 |
9 | 1063704381686521 |
10 | 222211001120221 |
11 | 6489217a115863 |
12 | 20b09b92807b91 |
13 | 96cb53b353629 |
14 | 3cc30d98d5621 |
15 | 1aa5341088331 |
hex | ca1987c975dd |
222211001120221 has 8 divisors (see below), whose sum is σ = 235300822871040. Its totient is φ = 209123244523968.
The previous prime is 222211001120197. The next prime is 222211001120281. The reversal of 222211001120221 is 122021100112222.
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-222211001120221 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 (222211001120281) 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, 516067101 + ... + 516497506.
It is an arithmetic number, because the mean of its divisors is an integer number (29412602858880).
Almost surely, 2222211001120221 is an apocalyptic number.
It is an amenable number.
222211001120221 is a deficient number, since it is larger than the sum of its proper divisors (13089821750819).
222211001120221 is a wasteful number, since it uses less digits than its factorization.
222211001120221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1032577283.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 222211001120221 its reverse (122021100112222), we get a palindrome (344232101232443).
The spelling of 222211001120221 in words is "two hundred twenty-two trillion, two hundred eleven billion, one million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •