Base | Representation |
---|---|
bin | 110010000001100100011110… |
… | …011110101100011000111110 |
3 | 1001211222202210220002012102021 |
4 | 302001210132132230120332 |
5 | 212314121403020201342 |
6 | 2055531143510550354 |
7 | 64225133062300054 |
oct | 6201443636543076 |
9 | 1054882726065367 |
10 | 220010211100222 |
11 | 6411389656a094 |
12 | 208135526683ba |
13 | 959bb48c0294a |
14 | 3c487a00761d4 |
15 | 1a67e855d1567 |
hex | c8191e7ac63e |
220010211100222 has 8 divisors (see below), whose sum is σ = 330595308421200. Its totient is φ = 109811774959824.
The previous prime is 220010211100157. The next prime is 220010211100327. The reversal of 220010211100222 is 222001112010022.
It is a happy number.
220010211100222 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 220010211100196 and 220010211100205.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 96665293722 + ... + 96665295997.
It is an arithmetic number, because the mean of its divisors is an integer number (41324413552650).
Almost surely, 2220010211100222 is an apocalyptic number.
220010211100222 is a deficient number, since it is larger than the sum of its proper divisors (110585097320978).
220010211100222 is a wasteful number, since it uses less digits than its factorization.
220010211100222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 193330590290.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 220010211100222 its reverse (222001112010022), we get a palindrome (442011323110244).
The spelling of 220010211100222 in words is "two hundred twenty trillion, ten billion, two hundred eleven million, one hundred thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •