Base | Representation |
---|---|
bin | 10001110010001100001… |
… | …001100010010101001101 |
3 | 11022211111210012021110210 |
4 | 101302030021202111031 |
5 | 130010401214202341 |
6 | 2333233552153033 |
7 | 154203215534442 |
oct | 21621411422515 |
9 | 4284453167423 |
10 | 1222122022221 |
11 | 431332025891 |
12 | 178a32238779 |
13 | 8b3267c1199 |
14 | 4321858d9c9 |
15 | 21bcbdbdc16 |
hex | 11c8c26254d |
1222122022221 has 8 divisors (see below), whose sum is σ = 1629751742560. Its totient is φ = 814620158352.
The previous prime is 1222122022207. The next prime is 1222122022267. The reversal of 1222122022221 is 1222202212221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1222122022221 - 217 = 1222121891149 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1222122022021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31941811 + ... + 31980048.
It is an arithmetic number, because the mean of its divisors is an integer number (203718967820).
Almost surely, 21222122022221 is an apocalyptic number.
It is an amenable number.
1222122022221 is a deficient number, since it is larger than the sum of its proper divisors (407629720339).
1222122022221 is an equidigital number, since it uses as much as digits as its factorization.
1222122022221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63928235.
The product of its (nonzero) digits is 512, while the sum is 21.
Adding to 1222122022221 its reverse (1222202212221), we get a palindrome (2444324234442).
The spelling of 1222122022221 in words is "one trillion, two hundred twenty-two billion, one hundred twenty-two million, twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •