Base | Representation |
---|---|
bin | 110010010001100111100111… |
… | …111010110100011001001101 |
3 | 1001222220012120021111012202112 |
4 | 302101213213322310121031 |
5 | 212440204113143234404 |
6 | 2102133542405233405 |
7 | 64400615542062266 |
oct | 6221474772643115 |
9 | 1058805507435675 |
10 | 221113102321229 |
11 | 644a95a3943228 |
12 | 2097124a702865 |
13 | 964bb50996a81 |
14 | 3c85d0750b96d |
15 | 1a869d4cda56e |
hex | c919e7eb464d |
221113102321229 has 2 divisors, whose sum is σ = 221113102321230. Its totient is φ = 221113102321228.
The previous prime is 221113102321213. The next prime is 221113102321253. The reversal of 221113102321229 is 922123201311122.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 215161078456900 + 5952023864329 = 14668370^2 + 2439677^2 .
It is a cyclic number.
It is not a de Polignac number, because 221113102321229 - 24 = 221113102321213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 221113102321195 and 221113102321204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (221113102321289) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110556551160614 + 110556551160615.
It is an arithmetic number, because the mean of its divisors is an integer number (110556551160615).
Almost surely, 2221113102321229 is an apocalyptic number.
It is an amenable number.
221113102321229 is a deficient number, since it is larger than the sum of its proper divisors (1).
221113102321229 is an equidigital number, since it uses as much as digits as its factorization.
221113102321229 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 32.
The spelling of 221113102321229 in words is "two hundred twenty-one trillion, one hundred thirteen billion, one hundred two million, three hundred twenty-one thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •