Base | Representation |
---|---|
bin | 1100110100000001001… |
… | …0110101010110001101 |
3 | 210001011200101202101212 |
4 | 3031000102311112031 |
5 | 12101302213323041 |
6 | 245042254344205 |
7 | 21621554136113 |
oct | 3150022652615 |
9 | 701150352355 |
10 | 220122011021 |
11 | 85398155980 |
12 | 367b24bb065 |
13 | 179b0076183 |
14 | a922687ab3 |
15 | 5ad4c918eb |
hex | 33404b558d |
220122011021 has 8 divisors (see below), whose sum is σ = 245242318464. Its totient is φ = 195853239520.
The previous prime is 220122010973. The next prime is 220122011063. The reversal of 220122011021 is 120110221022.
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 220122011021 - 26 = 220122010957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 220122010987 and 220122011005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220122011321) 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, 212883440 + ... + 212884473.
It is an arithmetic number, because the mean of its divisors is an integer number (30655289808).
Almost surely, 2220122011021 is an apocalyptic number.
It is an amenable number.
220122011021 is a deficient number, since it is larger than the sum of its proper divisors (25120307443).
220122011021 is a wasteful number, since it uses less digits than its factorization.
220122011021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 425767971.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 220122011021 its reverse (120110221022), we get a palindrome (340232232043).
The spelling of 220122011021 in words is "two hundred twenty billion, one hundred twenty-two million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •