Base | Representation |
---|---|
bin | 1100110011100110011… |
… | …1101000000101100110 |
3 | 210000212212200002021112 |
4 | 3030321213220011212 |
5 | 12101040031134342 |
6 | 245023214145022 |
7 | 21616024216205 |
oct | 3147147500546 |
9 | 700785602245 |
10 | 220010021222 |
11 | 8533aa15322 |
12 | 36780ab2172 |
13 | 17992ac5214 |
14 | a91185523c |
15 | 5aca01e682 |
hex | 33399e8166 |
220010021222 has 4 divisors (see below), whose sum is σ = 330015031836. Its totient is φ = 110005010610.
The previous prime is 220010021213. The next prime is 220010021237. The reversal of 220010021222 is 222120010022.
220010021222 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 222120010022 = 2 ⋅111060005011.
It is a junction number, because it is equal to n+sod(n) for n = 220010021197 and 220010021206.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 55002505304 + ... + 55002505307.
It is an arithmetic number, because the mean of its divisors is an integer number (82503757959).
Almost surely, 2220010021222 is an apocalyptic number.
220010021222 is a deficient number, since it is larger than the sum of its proper divisors (110005010614).
220010021222 is a wasteful number, since it uses less digits than its factorization.
220010021222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110005010613.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 220010021222 its reverse (222120010022), we get a palindrome (442130031244).
The spelling of 220010021222 in words is "two hundred twenty billion, ten million, twenty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •