Base | Representation |
---|---|
bin | 1100010101110101101… |
… | …1111100001111001101 |
3 | 202021021002220220211122 |
4 | 3011131123330033031 |
5 | 11433204334100323 |
6 | 241222345530325 |
7 | 21214035535415 |
oct | 3053533741715 |
9 | 667232826748 |
10 | 212021003213 |
11 | 81a103688a8 |
12 | 351114a39a5 |
13 | 16cbb928926 |
14 | a394809645 |
15 | 57ad992ec8 |
hex | 315d6fc3cd |
212021003213 has 8 divisors (see below), whose sum is σ = 213510878400. Its totient is φ = 210533434848.
The previous prime is 212021003209. The next prime is 212021003219. The reversal of 212021003213 is 312300120212.
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 212021003213 - 22 = 212021003209 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212021003191 and 212021003200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212021003219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 392033 + ... + 760086.
It is an arithmetic number, because the mean of its divisors is an integer number (26688859800).
Almost surely, 2212021003213 is an apocalyptic number.
It is an amenable number.
212021003213 is a deficient number, since it is larger than the sum of its proper divisors (1489875187).
212021003213 is a wasteful number, since it uses less digits than its factorization.
212021003213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1153411.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 212021003213 its reverse (312300120212), we get a palindrome (524321123425).
The spelling of 212021003213 in words is "two hundred twelve billion, twenty-one million, three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •