Base | Representation |
---|---|
bin | 1100011001111010001… |
… | …0011001000100100101 |
3 | 202101002020002221022011 |
4 | 3012132202121010211 |
5 | 11442423440310341 |
6 | 241523003434221 |
7 | 21253100265226 |
oct | 3063642310445 |
9 | 671066087264 |
10 | 213113213221 |
11 | 824209423a7 |
12 | 35377225971 |
13 | 17133cac93c |
14 | a4598bb24d |
15 | 58247dab81 |
hex | 319e899125 |
213113213221 has 2 divisors, whose sum is σ = 213113213222. Its totient is φ = 213113213220.
The previous prime is 213113213179. The next prime is 213113213227. The reversal of 213113213221 is 122312311312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 212322816225 + 790396996 = 460785^2 + 28114^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-213113213221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 213113213192 and 213113213201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (213113213227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106556606610 + 106556606611.
It is an arithmetic number, because the mean of its divisors is an integer number (106556606611).
Almost surely, 2213113213221 is an apocalyptic number.
It is an amenable number.
213113213221 is a deficient number, since it is larger than the sum of its proper divisors (1).
213113213221 is an equidigital number, since it uses as much as digits as its factorization.
213113213221 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 432, while the sum is 22.
Adding to 213113213221 its reverse (122312311312), we get a palindrome (335425524533).
The spelling of 213113213221 in words is "two hundred thirteen billion, one hundred thirteen million, two hundred thirteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •