Base | Representation |
---|---|
bin | 11001010001100… |
… | …10101111110101 |
3 | 112202221202001111 |
4 | 30220302233311 |
5 | 413234121323 |
6 | 33012155021 |
7 | 5153066506 |
oct | 1450625765 |
9 | 482852044 |
10 | 212020213 |
11 | a9752a19 |
12 | 5b008a71 |
13 | 34c05562 |
14 | 20230bad |
15 | 13930c0d |
hex | ca32bf5 |
212020213 has 2 divisors, whose sum is σ = 212020214. Its totient is φ = 212020212.
The previous prime is 212020181. The next prime is 212020223. The reversal of 212020213 is 312020212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 146361604 + 65658609 = 12098^2 + 8103^2 .
It is a cyclic number.
It is not a de Polignac number, because 212020213 - 25 = 212020181 is a prime.
It is a super-4 number, since 4×2120202134 (a number of 34 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 212020193 and 212020202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212020223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106010106 + 106010107.
It is an arithmetic number, because the mean of its divisors is an integer number (106010107).
Almost surely, 2212020213 is an apocalyptic number.
It is an amenable number.
212020213 is a deficient number, since it is larger than the sum of its proper divisors (1).
212020213 is an equidigital number, since it uses as much as digits as its factorization.
212020213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 13.
The square root of 212020213 is about 14560.9138792866. The cubic root of 212020213 is about 596.2921455968.
Adding to 212020213 its reverse (312020212), we get a palindrome (524040425).
Subtracting 212020213 from its reverse (312020212), we obtain a palindrome (99999999).
The spelling of 212020213 in words is "two hundred twelve million, twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •