Base | Representation |
---|---|
bin | 1100110011100110111… |
… | …1111110101101001101 |
3 | 210000220000210100010012 |
4 | 3030321233332231031 |
5 | 12101041111223041 |
6 | 245023333123005 |
7 | 21616051636361 |
oct | 3147157765515 |
9 | 700800710105 |
10 | 220012211021 |
11 | 85341180579 |
12 | 36781789465 |
13 | 179933b0b65 |
14 | a911c652a1 |
15 | 5aca3033eb |
hex | 3339bfeb4d |
220012211021 has 8 divisors (see below), whose sum is σ = 227121069120. Its totient is φ = 212993911872.
The previous prime is 220012211017. The next prime is 220012211051. The reversal of 220012211021 is 120112210022.
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 220012211021 - 22 = 220012211017 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 220012210987 and 220012211005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220012211051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22634801 + ... + 22644518.
It is an arithmetic number, because the mean of its divisors is an integer number (28390133640).
Almost surely, 2220012211021 is an apocalyptic number.
It is an amenable number.
220012211021 is a deficient number, since it is larger than the sum of its proper divisors (7108858099).
220012211021 is a wasteful number, since it uses less digits than its factorization.
220012211021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45279475.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 220012211021 its reverse (120112210022), we get a palindrome (340124421043).
Subtracting from 220012211021 its reverse (120112210022), we obtain a palindrome (99900000999).
The spelling of 220012211021 in words is "two hundred twenty billion, twelve million, two hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •