Base | Representation |
---|---|
bin | 11001010011000… |
… | …11110100011101 |
3 | 112210022221202221 |
4 | 30221203310131 |
5 | 413312034323 |
6 | 33020345341 |
7 | 5154564511 |
oct | 1451436435 |
9 | 483287687 |
10 | 212221213 |
11 | a987aa36 |
12 | 5b0a5251 |
13 | 34c75ba9 |
14 | 20284141 |
15 | 1397055d |
hex | ca63d1d |
212221213 has 4 divisors (see below), whose sum is σ = 212568028. Its totient is φ = 211874400.
The previous prime is 212221181. The next prime is 212221223. The reversal of 212221213 is 312122212.
It is a happy number.
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 76685049 + 135536164 = 8757^2 + 11642^2 .
It is a cyclic number.
It is not a de Polignac number, because 212221213 - 25 = 212221181 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212221223) 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, 172488 + ... + 173713.
It is an arithmetic number, because the mean of its divisors is an integer number (53142007).
Almost surely, 2212221213 is an apocalyptic number.
It is an amenable number.
212221213 is a deficient number, since it is larger than the sum of its proper divisors (346815).
212221213 is an equidigital number, since it uses as much as digits as its factorization.
212221213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 346814.
The product of its digits is 96, while the sum is 16.
The square root of 212221213 is about 14567.8142835499. The cubic root of 212221213 is about 596.4805189355.
Adding to 212221213 its reverse (312122212), we get a palindrome (524343425).
Subtracting 212221213 from its reverse (312122212), we obtain a palindrome (99900999).
The spelling of 212221213 in words is "two hundred twelve million, two hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •