Base | Representation |
---|---|
bin | 11001010011010… |
… | …01001100001110 |
3 | 112210101001221210 |
4 | 30221221030032 |
5 | 413313240324 |
6 | 33021035250 |
7 | 5155015611 |
oct | 1451511416 |
9 | 483331853 |
10 | 212243214 |
11 | a9895517 |
12 | 5b0b5b26 |
13 | 34c82c01 |
14 | 2028c178 |
15 | 13976d29 |
hex | ca6930e |
212243214 has 8 divisors (see below), whose sum is σ = 424486440. Its totient is φ = 70747736.
The previous prime is 212243209. The next prime is 212243219. The reversal of 212243214 is 412342212.
It is an interprime number because it is at equal distance from previous prime (212243209) and next prime (212243219).
It is a sphenic number, since it is the product of 3 distinct primes.
212243214 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212243219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17686929 + ... + 17686940.
It is an arithmetic number, because the mean of its divisors is an integer number (53060805).
Almost surely, 2212243214 is an apocalyptic number.
212243214 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212243214 is a wasteful number, since it uses less digits than its factorization.
212243214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35373874.
The product of its digits is 768, while the sum is 21.
The square root of 212243214 is about 14568.5693875548. The cubic root of 212243214 is about 596.5011306269.
Adding to 212243214 its reverse (412342212), we get a palindrome (624585426).
The spelling of 212243214 in words is "two hundred twelve million, two hundred forty-three thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •