Base | Representation |
---|---|
bin | 1100111000000100100… |
… | …1100100010111100101 |
3 | 210010222111211110112220 |
4 | 3032001021210113211 |
5 | 12111014241214341 |
6 | 245342244102553 |
7 | 21660535556544 |
oct | 3160111442745 |
9 | 703874743486 |
10 | 221210101221 |
11 | 858a637617a |
12 | 36a56994a59 |
13 | 17b24616c25 |
14 | a9c6da615b |
15 | 5b4a573a66 |
hex | 33812645e5 |
221210101221 has 8 divisors (see below), whose sum is σ = 294956007744. Its totient is φ = 147468797760.
The previous prime is 221210101213. The next prime is 221210101241. The reversal of 221210101221 is 122101012122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 221210101221 - 23 = 221210101213 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 221210101221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221210101241) 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 7 ways as a sum of consecutive naturals, for example, 1037025 + ... + 1232006.
It is an arithmetic number, because the mean of its divisors is an integer number (36869500968).
Almost surely, 2221210101221 is an apocalyptic number.
It is an amenable number.
221210101221 is a deficient number, since it is larger than the sum of its proper divisors (73745906523).
221210101221 is a wasteful number, since it uses less digits than its factorization.
221210101221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2301531.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 221210101221 its reverse (122101012122), we get a palindrome (343311113343).
The spelling of 221210101221 in words is "two hundred twenty-one billion, two hundred ten million, one hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •