Base | Representation |
---|---|
bin | 1010000001011101100001… |
… | …0111010011010010100101 |
3 | 1110000112010011020001102021 |
4 | 2200113120113103102211 |
5 | 2421023403100214341 |
6 | 35234341503543141 |
7 | 2215120231541233 |
oct | 240273027232245 |
9 | 43015104201367 |
10 | 11020221101221 |
11 | 3569716573612 |
12 | 129b9618baab1 |
13 | 61c2828636c7 |
14 | 2a154ad73953 |
15 | 1419dba4b9d1 |
hex | a05d85d34a5 |
11020221101221 has 2 divisors, whose sum is σ = 11020221101222. Its totient is φ = 11020221101220.
The previous prime is 11020221101203. The next prime is 11020221101231. The reversal of 11020221101221 is 12210112202011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6310214336196 + 4710006765025 = 2512014^2 + 2170255^2 .
It is a cyclic number.
It is not a de Polignac number, because 11020221101221 - 215 = 11020221068453 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11020221101195 and 11020221101204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11020221101231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510110550610 + 5510110550611.
It is an arithmetic number, because the mean of its divisors is an integer number (5510110550611).
Almost surely, 211020221101221 is an apocalyptic number.
It is an amenable number.
11020221101221 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020221101221 is an equidigital number, since it uses as much as digits as its factorization.
11020221101221 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 11020221101221 its reverse (12210112202011), we get a palindrome (23230333303232).
The spelling of 11020221101221 in words is "eleven trillion, twenty billion, two hundred twenty-one million, one hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •