Base | Representation |
---|---|
bin | 1010001101000110001000… |
… | …1001011010000001101101 |
3 | 1110201122001010220122101021 |
4 | 2203101202021122001231 |
5 | 2432312231402211341 |
6 | 35510235432214141 |
7 | 2235424365456631 |
oct | 243214211320155 |
9 | 43648033818337 |
10 | 11220101210221 |
11 | 3636466697942 |
12 | 131264523a351 |
13 | 635088096457 |
14 | 2ab0ad166dc1 |
15 | 146cd96dc9d1 |
hex | a346225a06d |
11220101210221 has 2 divisors, whose sum is σ = 11220101210222. Its totient is φ = 11220101210220.
The previous prime is 11220101210167. The next prime is 11220101210251. The reversal of 11220101210221 is 12201210102211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10891227634596 + 328873575625 = 3300186^2 + 573475^2 .
It is a cyclic number.
It is not a de Polignac number, because 11220101210221 - 27 = 11220101210093 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11220101210195 and 11220101210204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11220101210251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5610050605110 + 5610050605111.
It is an arithmetic number, because the mean of its divisors is an integer number (5610050605111).
Almost surely, 211220101210221 is an apocalyptic number.
It is an amenable number.
11220101210221 is a deficient number, since it is larger than the sum of its proper divisors (1).
11220101210221 is an equidigital number, since it uses as much as digits as its factorization.
11220101210221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11220101210221 its reverse (12201210102211), we get a palindrome (23421311312432).
The spelling of 11220101210221 in words is "eleven trillion, two hundred twenty billion, one hundred one million, two hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •