Base | Representation |
---|---|
bin | 11001010001100… |
… | …00100011001101 |
3 | 112202221021201011 |
4 | 30220300203031 |
5 | 413233324323 |
6 | 33012045221 |
7 | 5153031331 |
oct | 1450604315 |
9 | 482837634 |
10 | 212011213 |
11 | a9747187 |
12 | 5b003811 |
13 | 34c0142b |
14 | 2022b7c1 |
15 | 1392d20d |
hex | ca308cd |
212011213 has 4 divisors (see below), whose sum is σ = 213956380. Its totient is φ = 210066048.
The previous prime is 212011207. The next prime is 212011223. The reversal of 212011213 is 312110212.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 61261929 + 150749284 = 7827^2 + 12278^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212011213 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212011193 and 212011202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212011223) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 972420 + ... + 972637.
It is an arithmetic number, because the mean of its divisors is an integer number (53489095).
Almost surely, 2212011213 is an apocalyptic number.
It is an amenable number.
212011213 is a deficient number, since it is larger than the sum of its proper divisors (1945167).
212011213 is a wasteful number, since it uses less digits than its factorization.
212011213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1945166.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 212011213 is about 14560.6048294705. The cubic root of 212011213 is about 596.2837081855.
Adding to 212011213 its reverse (312110212), we get a palindrome (524121425).
The spelling of 212011213 in words is "two hundred twelve million, eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •