Base | Representation |
---|---|
bin | 1100010101110101100… |
… | …0001110111011101101 |
3 | 202021021001002112111122 |
4 | 3011131120032323231 |
5 | 11433204111444323 |
6 | 241222313030325 |
7 | 21214024346534 |
oct | 3053530167355 |
9 | 667231075448 |
10 | 212020031213 |
11 | 81a0a8645a1 |
12 | 351110b53a5 |
13 | 16cbb678393 |
14 | a39463531b |
15 | 57ad84eec8 |
hex | 315d60eeed |
212020031213 has 2 divisors, whose sum is σ = 212020031214. Its totient is φ = 212020031212.
The previous prime is 212020031203. The next prime is 212020031287. The reversal of 212020031213 is 312130020212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 151100906089 + 60919125124 = 388717^2 + 246818^2 .
It is a cyclic number.
It is not a de Polignac number, because 212020031213 - 224 = 212003253997 is a prime.
It is a super-2 number, since 2×2120200312132 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 212020031191 and 212020031200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212020031203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106010015606 + 106010015607.
It is an arithmetic number, because the mean of its divisors is an integer number (106010015607).
Almost surely, 2212020031213 is an apocalyptic number.
It is an amenable number.
212020031213 is a deficient number, since it is larger than the sum of its proper divisors (1).
212020031213 is an equidigital number, since it uses as much as digits as its factorization.
212020031213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 212020031213 its reverse (312130020212), we get a palindrome (524150051425).
The spelling of 212020031213 in words is "two hundred twelve billion, twenty million, thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •