Base | Representation |
---|---|
bin | 1100110100011000100… |
… | …1110111000100111001 |
3 | 210001102112101110212010 |
4 | 3031012021313010321 |
5 | 12102002400301410 |
6 | 245100125440133 |
7 | 21624156565260 |
oct | 3150611670471 |
9 | 701375343763 |
10 | 220220322105 |
11 | 854386a3503 |
12 | 3681b410049 |
13 | 179c7548004 |
14 | a9317595d7 |
15 | 5add710c20 |
hex | 3346277139 |
220220322105 has 16 divisors (see below), whose sum is σ = 402688589184. Its totient is φ = 100672147200.
The previous prime is 220220322019. The next prime is 220220322107. The reversal of 220220322105 is 501223022022.
220220322105 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 220220322105 - 211 = 220220320057 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (220220322107) by changing a digit.
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 in 15 ways as a sum of consecutive naturals, for example, 1048668096 + ... + 1048668305.
It is an arithmetic number, because the mean of its divisors is an integer number (25168036824).
Almost surely, 2220220322105 is an apocalyptic number.
It is an amenable number.
220220322105 is a deficient number, since it is larger than the sum of its proper divisors (182468267079).
220220322105 is a wasteful number, since it uses less digits than its factorization.
220220322105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2097336416.
The product of its (nonzero) digits is 960, while the sum is 21.
Adding to 220220322105 its reverse (501223022022), we get a palindrome (721443344127).
The spelling of 220220322105 in words is "two hundred twenty billion, two hundred twenty million, three hundred twenty-two thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •