Base | Representation |
---|---|
bin | 1100110011111100001… |
… | …1000100011001000001 |
3 | 210001010020001102102010 |
4 | 3030333003010121001 |
5 | 12101231340213441 |
6 | 245040230243133 |
7 | 21621211330236 |
oct | 3147703043101 |
9 | 701106042363 |
10 | 220101101121 |
11 | 85387373a70 |
12 | 367a74b64a9 |
13 | 179a8934855 |
14 | a91d9a378d |
15 | 5ad3011116 |
hex | 333f0c4641 |
220101101121 has 32 divisors (see below), whose sum is σ = 324727320960. Its totient is φ = 131488358400.
The previous prime is 220101101119. The next prime is 220101101131. The reversal of 220101101121 is 121101101022.
It is not a de Polignac number, because 220101101121 - 21 = 220101101119 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 220101101097 and 220101101106.
It is not an unprimeable number, because it can be changed into a prime (220101101111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4119345 + ... + 4172433.
It is an arithmetic number, because the mean of its divisors is an integer number (10147728780).
Almost surely, 2220101101121 is an apocalyptic number.
It is an amenable number.
220101101121 is a deficient number, since it is larger than the sum of its proper divisors (104626219839).
220101101121 is a wasteful number, since it uses less digits than its factorization.
220101101121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54897.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 220101101121 its reverse (121101101022), we get a palindrome (341202202143).
Subtracting from 220101101121 its reverse (121101101022), we obtain a palindrome (99000000099).
The spelling of 220101101121 in words is "two hundred twenty billion, one hundred one million, one hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •