Base | Representation |
---|---|
bin | 110000001101000000011111… |
… | …110110000101010111011010 |
3 | 1000210122000100212111220011202 |
4 | 300031000133312011113122 |
5 | 210241402221210031020 |
6 | 2030515302143354202 |
7 | 62440334414330234 |
oct | 6015003766052732 |
9 | 1023560325456152 |
10 | 212000120002010 |
11 | 61605822a0046a |
12 | 1b93b0632b2962 |
13 | 913a6aa7a6572 |
14 | 3a4cc0951d254 |
15 | 19799227b5e75 |
hex | c0d01fd855da |
212000120002010 has 8 divisors (see below), whose sum is σ = 381600216003636. Its totient is φ = 84800048000800.
The previous prime is 212000120002007. The next prime is 212000120002049. The reversal of 212000120002010 is 10200021000212.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 201681948981529 + 10318171020481 = 14201477^2 + 3212191^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×2120001200020103 (a number of 44 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 212000120001982 and 212000120002000.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 10600006000091 + ... + 10600006000110.
Almost surely, 2212000120002010 is an apocalyptic number.
212000120002010 is a deficient number, since it is larger than the sum of its proper divisors (169600096001626).
212000120002010 is a wasteful number, since it uses less digits than its factorization.
212000120002010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21200012000208.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 212000120002010 its reverse (10200021000212), we get a palindrome (222200141002222).
The spelling of 212000120002010 in words is "two hundred twelve trillion, one hundred twenty million, two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •