Base | Representation |
---|---|
bin | 110010000100010111100100… |
… | …011101000011101011100001 |
3 | 1001212200011011121111102022112 |
4 | 302010113210131003223201 |
5 | 212330244220321333441 |
6 | 2100155345335445105 |
7 | 64245051334431314 |
oct | 6204274435035341 |
9 | 1055604147442275 |
10 | 220202511121121 |
11 | 641883a6950aa1 |
12 | 2084487b526795 |
13 | 95b4013bb6169 |
14 | 3c53c0366a97b |
15 | 1a6ce8ca704eb |
hex | c845e4743ae1 |
220202511121121 has 2 divisors, whose sum is σ = 220202511121122. Its totient is φ = 220202511121120.
The previous prime is 220202511121091. The next prime is 220202511121127. The reversal of 220202511121121 is 121121115202022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 216498853210000 + 3703657911121 = 14713900^2 + 1924489^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-220202511121121 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (220202511121127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110101255560560 + 110101255560561.
It is an arithmetic number, because the mean of its divisors is an integer number (110101255560561).
Almost surely, 2220202511121121 is an apocalyptic number.
It is an amenable number.
220202511121121 is a deficient number, since it is larger than the sum of its proper divisors (1).
220202511121121 is an equidigital number, since it uses as much as digits as its factorization.
220202511121121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 320, while the sum is 23.
Adding to 220202511121121 its reverse (121121115202022), we get a palindrome (341323626323143).
The spelling of 220202511121121 in words is "two hundred twenty trillion, two hundred two billion, five hundred eleven million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •