Base | Representation |
---|---|
bin | 1100010101110000110… |
… | …0100101011000010101 |
3 | 202021012122210000111011 |
4 | 3011130030211120111 |
5 | 11433134022401323 |
6 | 241220324012221 |
7 | 21213363653314 |
oct | 3053414453025 |
9 | 667178700434 |
10 | 212000200213 |
11 | 819aa64a23a |
12 | 35106531071 |
13 | 16cb7523b69 |
14 | a391b5227b |
15 | 57abc3420d |
hex | 315c325615 |
212000200213 has 8 divisors (see below), whose sum is σ = 214484070528. Its totient is φ = 209524515024.
The previous prime is 212000200201. The next prime is 212000200219. The reversal of 212000200213 is 312002000212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212000200213 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212000200193 and 212000200202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212000200219) 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, 1994170 + ... + 2097787.
It is an arithmetic number, because the mean of its divisors is an integer number (26810508816).
Almost surely, 2212000200213 is an apocalyptic number.
It is an amenable number.
212000200213 is a deficient number, since it is larger than the sum of its proper divisors (2483870315).
212000200213 is a wasteful number, since it uses less digits than its factorization.
212000200213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4092563.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 212000200213 its reverse (312002000212), we get a palindrome (524002200425).
The spelling of 212000200213 in words is "two hundred twelve billion, two hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •