Base | Representation |
---|---|
bin | 1100010101111111111… |
… | …0100010000000001110 |
3 | 202021101002010100020212 |
4 | 3011133332202000032 |
5 | 11433301242001410 |
6 | 241230511242422 |
7 | 21215064034022 |
oct | 3053776420016 |
9 | 667332110225 |
10 | 212063625230 |
11 | 81a3242a406 |
12 | 35123819412 |
13 | 16cc76cca62 |
14 | a39a342382 |
15 | 57b25b1b05 |
hex | 315ffa200e |
212063625230 has 8 divisors (see below), whose sum is σ = 381714525432. Its totient is φ = 84825450088.
The previous prime is 212063625223. The next prime is 212063625239. The reversal of 212063625230 is 32526360212.
212063625230 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2120636252302 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212063625239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10603181252 + ... + 10603181271.
It is an arithmetic number, because the mean of its divisors is an integer number (47714315679).
Almost surely, 2212063625230 is an apocalyptic number.
212063625230 is a deficient number, since it is larger than the sum of its proper divisors (169650900202).
212063625230 is a wasteful number, since it uses less digits than its factorization.
212063625230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21206362530.
The product of its (nonzero) digits is 25920, while the sum is 32.
Adding to 212063625230 its reverse (32526360212), we get a palindrome (244589985442).
The spelling of 212063625230 in words is "two hundred twelve billion, sixty-three million, six hundred twenty-five thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •