Base | Representation |
---|---|
bin | 1100110100000000111… |
… | …1000011011100101001 |
3 | 210001011121112102020211 |
4 | 3031000033003130221 |
5 | 12101301440121301 |
6 | 245042221221121 |
7 | 21621542541325 |
oct | 3150017033451 |
9 | 701147472224 |
10 | 220121020201 |
11 | 85397639515 |
12 | 367b21017a1 |
13 | 179acaba1a4 |
14 | a9224aa985 |
15 | 5ad4b48051 |
hex | 33403c3729 |
220121020201 has 4 divisors (see below), whose sum is σ = 227221698304. Its totient is φ = 213020342100.
The previous prime is 220121020183. The next prime is 220121020277. The reversal of 220121020201 is 102020121022.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 220121020201 - 29 = 220121019689 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (220121020901) 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 3 ways as a sum of consecutive naturals, for example, 3550339005 + ... + 3550339066.
It is an arithmetic number, because the mean of its divisors is an integer number (56805424576).
Almost surely, 2220121020201 is an apocalyptic number.
It is an amenable number.
220121020201 is a deficient number, since it is larger than the sum of its proper divisors (7100678103).
220121020201 is an equidigital number, since it uses as much as digits as its factorization.
220121020201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7100678102.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 220121020201 its reverse (102020121022), we get a palindrome (322141141223).
The spelling of 220121020201 in words is "two hundred twenty billion, one hundred twenty-one million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •