Base | Representation |
---|---|
bin | 1100110011100110111… |
… | …1101000110010000101 |
3 | 210000220000121202221021 |
4 | 3030321233220302011 |
5 | 12101041100334341 |
6 | 245023331151141 |
7 | 21616051113514 |
oct | 3147157506205 |
9 | 700800552837 |
10 | 220012121221 |
11 | 8534111a062 |
12 | 367817454b1 |
13 | 1799337c019 |
14 | a911c4067b |
15 | 5aca2d69d1 |
hex | 3339be8c85 |
220012121221 has 4 divisors (see below), whose sum is σ = 220162919200. Its totient is φ = 219861323244.
The previous prime is 220012121191. The next prime is 220012121227. The reversal of 220012121221 is 122121210022.
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 220012121221 - 213 = 220012113029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220012121195 and 220012121204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220012121227) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 75396801 + ... + 75399718.
It is an arithmetic number, because the mean of its divisors is an integer number (55040729800).
Almost surely, 2220012121221 is an apocalyptic number.
It is an amenable number.
220012121221 is a deficient number, since it is larger than the sum of its proper divisors (150797979).
220012121221 is a wasteful number, since it uses less digits than its factorization.
220012121221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 150797978.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 220012121221 its reverse (122121210022), we get a palindrome (342133331243).
The spelling of 220012121221 in words is "two hundred twenty billion, twelve million, one hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •