Base | Representation |
---|---|
bin | 100000010101011001100… |
… | …001011010001001101001 |
3 | 21212102101000001110021121 |
4 | 200111121201122021221 |
5 | 242401124001201441 |
6 | 4420434523535241 |
7 | 316351142362165 |
oct | 40253141321151 |
9 | 7772330043247 |
10 | 2222000022121 |
11 | 7873880a3250 |
12 | 2ba77b38a521 |
13 | 1316c27125c9 |
14 | 7978c719ca5 |
15 | 3cbeca86dd1 |
hex | 2055985a269 |
2222000022121 has 8 divisors (see below), whose sum is σ = 2426996325600. Its totient is φ = 2017503102240.
The previous prime is 2222000022113. The next prime is 2222000022197. The reversal of 2222000022121 is 1212200002222.
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 2222000022121 - 23 = 2222000022113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2222000022095 and 2222000022104.
It is not an unprimeable number, because it can be changed into a prime (2222010022121) 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, 124836591 + ... + 124854388.
It is an arithmetic number, because the mean of its divisors is an integer number (303374540700).
Almost surely, 22222000022121 is an apocalyptic number.
It is an amenable number.
2222000022121 is a deficient number, since it is larger than the sum of its proper divisors (204996303479).
2222000022121 is a wasteful number, since it uses less digits than its factorization.
2222000022121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 249691799.
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 2222000022121 its reverse (1212200002222), we get a palindrome (3434200024343).
The spelling of 2222000022121 in words is "two trillion, two hundred twenty-two billion, twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •