Base | Representation |
---|---|
bin | 1010001101000110001010… |
… | …1011000000111000011001 |
3 | 1110201122001202111020021212 |
4 | 2203101202223000320121 |
5 | 2432312241131120441 |
6 | 35510240345112505 |
7 | 2235424533401522 |
oct | 243214253007031 |
9 | 43648052436255 |
10 | 11220110020121 |
11 | 3636470664952 |
12 | 1312648188735 |
13 | 635089b5c402 |
14 | 2ab0b03bb849 |
15 | 146cda37ceeb |
hex | a3462ac0e19 |
11220110020121 has 2 divisors, whose sum is σ = 11220110020122. Its totient is φ = 11220110020120.
The previous prime is 11220110020087. The next prime is 11220110020139. The reversal of 11220110020121 is 12102001102211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11215298655625 + 4811364496 = 3348925^2 + 69364^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11220110020121 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11220110020096 and 11220110020105.
It is not a weakly prime, because it can be changed into another prime (11220110020151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5610055010060 + 5610055010061.
It is an arithmetic number, because the mean of its divisors is an integer number (5610055010061).
Almost surely, 211220110020121 is an apocalyptic number.
It is an amenable number.
11220110020121 is a deficient number, since it is larger than the sum of its proper divisors (1).
11220110020121 is an equidigital number, since it uses as much as digits as its factorization.
11220110020121 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 11220110020121 its reverse (12102001102211), we get a palindrome (23322111122332).
The spelling of 11220110020121 in words is "eleven trillion, two hundred twenty billion, one hundred ten million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.212 sec. • engine limits •