Base | Representation |
---|---|
bin | 1010000111010001100110… |
… | …0111110111011000101101 |
3 | 1110101001220220101111101112 |
4 | 2201310121213313120231 |
5 | 2424142431123211341 |
6 | 35352300431521405 |
7 | 2225254310134652 |
oct | 241643147673055 |
9 | 43331826344345 |
10 | 11120100210221 |
11 | 35a800a7394a2 |
12 | 12b7197089265 |
13 | 62880c2c67c2 |
14 | 2a6303d25c29 |
15 | 1443d5356aeb |
hex | a1d199f762d |
11120100210221 has 2 divisors, whose sum is σ = 11120100210222. Its totient is φ = 11120100210220.
The previous prime is 11120100210187. The next prime is 11120100210229. The reversal of 11120100210221 is 12201200102111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10311413677321 + 808686532900 = 3211139^2 + 899270^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11120100210221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11120100210196 and 11120100210205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11120100210229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560050105110 + 5560050105111.
It is an arithmetic number, because the mean of its divisors is an integer number (5560050105111).
Almost surely, 211120100210221 is an apocalyptic number.
It is an amenable number.
11120100210221 is a deficient number, since it is larger than the sum of its proper divisors (1).
11120100210221 is an equidigital number, since it uses as much as digits as its factorization.
11120100210221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11120100210221 its reverse (12201200102111), we get a palindrome (23321300312332).
The spelling of 11120100210221 in words is "eleven trillion, one hundred twenty billion, one hundred million, two hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •