Base | Representation |
---|---|
bin | 1100010110100011100… |
… | …1001000000101111001 |
3 | 202021202111120200211011 |
4 | 3011220321020011321 |
5 | 11434103040001241 |
6 | 241253413233521 |
7 | 21221561315530 |
oct | 3055071100571 |
9 | 667674520734 |
10 | 212213203321 |
11 | 81aa9903669 |
12 | 351659328a1 |
13 | 1701c6b18c2 |
14 | a3b215b317 |
15 | 57c07ab281 |
hex | 3168e48179 |
212213203321 has 8 divisors (see below), whose sum is σ = 243424319744. Its totient is φ = 181225823040.
The previous prime is 212213203313. The next prime is 212213203357. The reversal of 212213203321 is 123302312212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 212213203321 - 23 = 212213203313 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212213203292 and 212213203301.
It is not an unprimeable number, because it can be changed into a prime (212213203361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 55932000 + ... + 55935793.
It is an arithmetic number, because the mean of its divisors is an integer number (30428039968).
Almost surely, 2212213203321 is an apocalyptic number.
It is an amenable number.
212213203321 is a deficient number, since it is larger than the sum of its proper divisors (31211116423).
212213203321 is a wasteful number, since it uses less digits than its factorization.
212213203321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111868071.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 212213203321 its reverse (123302312212), we get a palindrome (335515515533).
The spelling of 212213203321 in words is "two hundred twelve billion, two hundred thirteen million, two hundred three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •