Base | Representation |
---|---|
bin | 1100110011111100001… |
… | …1011111001110001101 |
3 | 210001010020021000011111 |
4 | 3030333003133032031 |
5 | 12101231402223041 |
6 | 245040232452021 |
7 | 21621212265526 |
oct | 3147703371615 |
9 | 701106230144 |
10 | 220101211021 |
11 | 8538743959a |
12 | 367a754a011 |
13 | 179a8972893 |
14 | a91d9d184d |
15 | 5ad3033981 |
hex | 333f0df38d |
220101211021 has 8 divisors (see below), whose sum is σ = 220807512000. Its totient is φ = 219396032160.
The previous prime is 220101211019. The next prime is 220101211027. The reversal of 220101211021 is 120112101022.
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 220101211021 - 21 = 220101211019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220101210992 and 220101211010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220101211027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 113280 + ... + 673078.
It is an arithmetic number, because the mean of its divisors is an integer number (27600939000).
Almost surely, 2220101211021 is an apocalyptic number.
It is an amenable number.
220101211021 is a deficient number, since it is larger than the sum of its proper divisors (706300979).
220101211021 is an equidigital number, since it uses as much as digits as its factorization.
220101211021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 561059.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 220101211021 its reverse (120112101022), we get a palindrome (340213312043).
The spelling of 220101211021 in words is "two hundred twenty billion, one hundred one million, two hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •