Base | Representation |
---|---|
bin | 110100010000001101… |
… | …1011101101101110100 |
3 | 101201122022222012202001 |
4 | 1220200123131231310 |
5 | 3314303041021322 |
6 | 123314450425044 |
7 | 11051514430342 |
oct | 1504033355564 |
9 | 351568865661 |
10 | 112213220212 |
11 | 4365348a225 |
12 | 198b7b92184 |
13 | a773ba9a72 |
14 | 5607102992 |
15 | 2dbb576827 |
hex | 1a206ddb74 |
112213220212 has 12 divisors (see below), whose sum is σ = 197137234980. Its totient is φ = 55888295936.
The previous prime is 112213220159. The next prime is 112213220213. The reversal of 112213220212 is 212022312211.
It can be written as a sum of positive squares in 2 ways, for example, as 104538408976 + 7674811236 = 323324^2 + 87606^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 112213220212.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112213220213) 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, 54577387 + ... + 54579442.
It is an arithmetic number, because the mean of its divisors is an integer number (16428102915).
Almost surely, 2112213220212 is an apocalyptic number.
It is an amenable number.
112213220212 is a deficient number, since it is larger than the sum of its proper divisors (84924014768).
112213220212 is a wasteful number, since it uses less digits than its factorization.
112213220212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109157090 (or 109157088 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 112213220212 its reverse (212022312211), we get a palindrome (324235532423).
The spelling of 112213220212 in words is "one hundred twelve billion, two hundred thirteen million, two hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •