Base | Representation |
---|---|
bin | 10001110010010010000… |
… | …011100001101111001101 |
3 | 11022211202200122110122201 |
4 | 101302102003201233031 |
5 | 130011102101011341 |
6 | 2333251452041501 |
7 | 154205531010646 |
oct | 21622203415715 |
9 | 4284680573581 |
10 | 1222221110221 |
11 | 431382a540a1 |
12 | 178a5b463291 |
13 | 8b3411a5837 |
14 | 432277c46cd |
15 | 21bd5943331 |
hex | 11c920e1bcd |
1222221110221 has 8 divisors (see below), whose sum is σ = 1252225735488. Its totient is φ = 1192225740000.
The previous prime is 1222221110203. The next prime is 1222221110269. The reversal of 1222221110221 is 1220111222221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1222221110221 - 25 = 1222221110189 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 (1222221110521) 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 7 ways as a sum of consecutive naturals, for example, 2046025 + ... + 2575006.
It is an arithmetic number, because the mean of its divisors is an integer number (156528216936).
Almost surely, 21222221110221 is an apocalyptic number.
It is an amenable number.
1222221110221 is a deficient number, since it is larger than the sum of its proper divisors (30004625267).
1222221110221 is an equidigital number, since it uses as much as digits as its factorization.
1222221110221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4627523.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 1222221110221 its reverse (1220111222221), we get a palindrome (2442332332442).
The spelling of 1222221110221 in words is "one trillion, two hundred twenty-two billion, two hundred twenty-one million, one hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •