Base | Representation |
---|---|
bin | 110000010001011010100101… |
… | …101011001110001011111101 |
3 | 1000211200222012000011001212012 |
4 | 300101122211223032023331 |
5 | 210311333032312342341 |
6 | 2031310354024021005 |
7 | 62501246401411655 |
oct | 6021324553161375 |
9 | 1024628160131765 |
10 | 212303013012221 |
11 | 6171222513209a |
12 | 1b9898b5601765 |
13 | 916011ba99521 |
14 | 3a5d740977365 |
15 | 198274de330eb |
hex | c116a5ace2fd |
212303013012221 has 2 divisors, whose sum is σ = 212303013012222. Its totient is φ = 212303013012220.
The previous prime is 212303013012179. The next prime is 212303013012241. The reversal of 212303013012221 is 122210310303212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 137974647480121 + 74328365532100 = 11746261^2 + 8621390^2 .
It is a cyclic number.
It is not a de Polignac number, because 212303013012221 - 230 = 212301939270397 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212303013012241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106151506506110 + 106151506506111.
It is an arithmetic number, because the mean of its divisors is an integer number (106151506506111).
Almost surely, 2212303013012221 is an apocalyptic number.
It is an amenable number.
212303013012221 is a deficient number, since it is larger than the sum of its proper divisors (1).
212303013012221 is an equidigital number, since it uses as much as digits as its factorization.
212303013012221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 212303013012221 its reverse (122210310303212), we get a palindrome (334513323315433).
The spelling of 212303013012221 in words is "two hundred twelve trillion, three hundred three billion, thirteen million, twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •