Base | Representation |
---|---|
bin | 100000010101011001100… |
… | …010001010100000111101 |
3 | 21212102101000102112000122 |
4 | 200111121202022200331 |
5 | 242401124024021341 |
6 | 4420434532104325 |
7 | 316351144145555 |
oct | 40253142124075 |
9 | 7772330375018 |
10 | 2222000220221 |
11 | 787388219071 |
12 | 2ba77b4650a5 |
13 | 1316c2781822 |
14 | 7978c76c165 |
15 | 3cbecac594b |
hex | 2055988a83d |
2222000220221 has 16 divisors (see below), whose sum is σ = 2443816863360. Its totient is φ = 2013383211840.
The previous prime is 2222000220217. The next prime is 2222000220233. The reversal of 2222000220221 is 1220220002222.
It is a cyclic number.
It is not a de Polignac number, because 2222000220221 - 22 = 2222000220217 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2222000220221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2222000223221) 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 15 ways as a sum of consecutive naturals, for example, 31392335 + ... + 31463036.
It is an arithmetic number, because the mean of its divisors is an integer number (152738553960).
Almost surely, 22222000220221 is an apocalyptic number.
It is an amenable number.
2222000220221 is a deficient number, since it is larger than the sum of its proper divisors (221816643139).
2222000220221 is a wasteful number, since it uses less digits than its factorization.
2222000220221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62855476.
The product of its (nonzero) digits is 256, while the sum is 17.
Adding to 2222000220221 its reverse (1220220002222), we get a palindrome (3442220222443).
The spelling of 2222000220221 in words is "two trillion, two hundred twenty-two billion, two hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •