Base | Representation |
---|---|
bin | 1100010110001011110… |
… | …0000010011100011001 |
3 | 202021111112121020210011 |
4 | 3011202330002130121 |
5 | 11433402001201241 |
6 | 241235444121521 |
7 | 21216236221063 |
oct | 3054274023431 |
9 | 667445536704 |
10 | 212113303321 |
11 | 81a58480287 |
12 | 351383962a1 |
13 | 17004aa478a |
14 | a3a2b94733 |
15 | 57b6b26281 |
hex | 3162f02719 |
212113303321 has 2 divisors, whose sum is σ = 212113303322. Its totient is φ = 212113303320.
The previous prime is 212113303307. The next prime is 212113303361. The reversal of 212113303321 is 123303311212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 119259024921 + 92854278400 = 345339^2 + 304720^2 .
It is a cyclic number.
It is not a de Polignac number, because 212113303321 - 221 = 212111206169 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 212113303292 and 212113303301.
It is not a weakly prime, because it can be changed into another prime (212113303361) 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, 106056651660 + 106056651661.
It is an arithmetic number, because the mean of its divisors is an integer number (106056651661).
Almost surely, 2212113303321 is an apocalyptic number.
It is an amenable number.
212113303321 is a deficient number, since it is larger than the sum of its proper divisors (1).
212113303321 is an equidigital number, since it uses as much as digits as its factorization.
212113303321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 212113303321 its reverse (123303311212), we get a palindrome (335416614533).
The spelling of 212113303321 in words is "two hundred twelve billion, one hundred thirteen million, three hundred three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •