Base | Representation |
---|---|
bin | 1100110011101001010… |
… | …1010101000101010101 |
3 | 210000220201012202211020 |
4 | 3030322111111011111 |
5 | 12101101113031010 |
6 | 245024323031353 |
7 | 21616231105461 |
oct | 3147225250525 |
9 | 700821182736 |
10 | 220022002005 |
11 | 853467586a3 |
12 | 36784b0b559 |
13 | 1799542b540 |
14 | a9132934a1 |
15 | 5acb0d9470 |
hex | 333a555155 |
220022002005 has 16 divisors (see below), whose sum is σ = 379114834560. Its totient is φ = 108318523968.
The previous prime is 220022001967. The next prime is 220022002009. The reversal of 220022002005 is 500200220022.
220022002005 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 220022002005 - 234 = 202842132821 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220022002009) 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, 564158785 + ... + 564159174.
It is an arithmetic number, because the mean of its divisors is an integer number (23694677160).
Almost surely, 2220022002005 is an apocalyptic number.
It is an amenable number.
220022002005 is a deficient number, since it is larger than the sum of its proper divisors (159092832555).
220022002005 is a wasteful number, since it uses less digits than its factorization.
220022002005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1128317980.
The product of its (nonzero) digits is 160, while the sum is 15.
Adding to 220022002005 its reverse (500200220022), we get a palindrome (720222222027).
The spelling of 220022002005 in words is "two hundred twenty billion, twenty-two million, two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •