Base | Representation |
---|---|
bin | 110000001101000000011001… |
… | …010110010001110010110100 |
3 | 1000210122000002021102001220202 |
4 | 300031000121112101302310 |
5 | 210241402010304013022 |
6 | 2030515243251220032 |
7 | 62440331621666123 |
oct | 6015003126216264 |
9 | 1023560067361822 |
10 | 212000011001012 |
11 | 616057774213a3 |
12 | 1b93b0328a7618 |
13 | 913a691030b30 |
14 | 3a4cbd8c67aba |
15 | 1979917e34592 |
hex | c0d019591cb4 |
212000011001012 has 24 divisors (see below), whose sum is σ = 399806809134600. Its totient is φ = 97780446222336.
The previous prime is 212000011000969. The next prime is 212000011001047. The reversal of 212000011001012 is 210100110000212.
It can be written as a sum of positive squares in 4 ways, for example, as 29854378055056 + 182145632945956 = 5463916^2 + 13496134^2 .
It is a junction number, because it is equal to n+sod(n) for n = 212000011000984 and 212000011001002.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 1368936437 + ... + 1369091292.
It is an arithmetic number, because the mean of its divisors is an integer number (16658617047275).
Almost surely, 2212000011001012 is an apocalyptic number.
It is an amenable number.
212000011001012 is a deficient number, since it is larger than the sum of its proper divisors (187806798133588).
212000011001012 is a wasteful number, since it uses less digits than its factorization.
212000011001012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2738029235 (or 2738029233 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 212000011001012 its reverse (210100110000212), we get a palindrome (422100121001224).
The spelling of 212000011001012 in words is "two hundred twelve trillion, eleven million, one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •