Base | Representation |
---|---|
bin | 1010001011111111011011… |
… | …0010101000110100101101 |
3 | 1110122211001022210221100021 |
4 | 2202333312302220310231 |
5 | 2432004343233211341 |
6 | 35453420143402141 |
7 | 2234153125566334 |
oct | 242776662506455 |
9 | 43584038727307 |
10 | 11201120210221 |
11 | 3629406389687 |
12 | 130aa285b3351 |
13 | 63335184bbc6 |
14 | 2aa1cc336d1b |
15 | 1465781579d1 |
hex | a2ff6ca8d2d |
11201120210221 has 2 divisors, whose sum is σ = 11201120210222. Its totient is φ = 11201120210220.
The previous prime is 11201120210177. The next prime is 11201120210263. The reversal of 11201120210221 is 12201202110211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7326576765225 + 3874543444996 = 2706765^2 + 1968386^2 .
It is a cyclic number.
It is not a de Polignac number, because 11201120210221 - 213 = 11201120202029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11201120210195 and 11201120210204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11201120220221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5600560105110 + 5600560105111.
It is an arithmetic number, because the mean of its divisors is an integer number (5600560105111).
Almost surely, 211201120210221 is an apocalyptic number.
It is an amenable number.
11201120210221 is a deficient number, since it is larger than the sum of its proper divisors (1).
11201120210221 is an equidigital number, since it uses as much as digits as its factorization.
11201120210221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11201120210221 its reverse (12201202110211), we get a palindrome (23402322320432).
The spelling of 11201120210221 in words is "eleven trillion, two hundred one billion, one hundred twenty million, two hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.373 sec. • engine limits •