Base | Representation |
---|---|
bin | 1100010110100000011… |
… | …1100110100101010100 |
3 | 202021201121011010102220 |
4 | 3011220013212211110 |
5 | 11434041224033022 |
6 | 241252231102340 |
7 | 21221343055323 |
oct | 3055007464524 |
9 | 667647133386 |
10 | 212200221012 |
11 | 81aa254688a |
12 | 351615119b0 |
13 | 17019ab7770 |
14 | a3b053c0ba |
15 | 57be59485c |
hex | 31681e6954 |
212200221012 has 48 divisors (see below), whose sum is σ = 533424615360. Its totient is φ = 65267451648.
The previous prime is 212200220941. The next prime is 212200221047. The reversal of 212200221012 is 210122002212.
212200221012 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 212200220982 and 212200221000.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 152439 + ... + 669057.
It is an arithmetic number, because the mean of its divisors is an integer number (11113012820).
Almost surely, 2212200221012 is an apocalyptic number.
It is an amenable number.
212200221012 is an abundant number, since it is smaller than the sum of its proper divisors (321224394348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212200221012 is a wasteful number, since it uses less digits than its factorization.
212200221012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 519272 (or 519270 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 212200221012 its reverse (210122002212), we get a palindrome (422322223224).
The spelling of 212200221012 in words is "two hundred twelve billion, two hundred million, two hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •