Base | Representation |
---|---|
bin | 1100110011111110010… |
… | …1000110000110011101 |
3 | 210001010211211121012210 |
4 | 3030333211012012131 |
5 | 12101241131133041 |
6 | 245041145351033 |
7 | 21621350210622 |
oct | 3147745060635 |
9 | 701124747183 |
10 | 220110021021 |
11 | 85391406690 |
12 | 367aa498479 |
13 | 179aa7388b7 |
14 | a920c46349 |
15 | 5ad3bc4016 |
hex | 333f94619d |
220110021021 has 8 divisors (see below), whose sum is σ = 320160030624. Its totient is φ = 133400012720.
The previous prime is 220110021013. The next prime is 220110021037. The reversal of 220110021021 is 120120011022.
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 220110021021 - 23 = 220110021013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 220110020988 and 220110021006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220110021041) 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, 3335000286 + ... + 3335000351.
It is an arithmetic number, because the mean of its divisors is an integer number (40020003828).
Almost surely, 2220110021021 is an apocalyptic number.
It is an amenable number.
220110021021 is a deficient number, since it is larger than the sum of its proper divisors (100050009603).
220110021021 is a wasteful number, since it uses less digits than its factorization.
220110021021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6670000651.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 220110021021 its reverse (120120011022), we get a palindrome (340230032043).
Subtracting from 220110021021 its reverse (120120011022), we obtain a palindrome (99990009999).
The spelling of 220110021021 in words is "two hundred twenty billion, one hundred ten million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •