Base | Representation |
---|---|
bin | 11001011111011010101011… |
… | …111111111000011001100100 |
3 | 112200221121211011101100222222 |
4 | 121133122223333320121210 |
5 | 104143303012213311322 |
6 | 1034234402401411512 |
7 | 32420455222621154 |
oct | 3137325377703144 |
9 | 480847734340888 |
10 | 112110122010212 |
11 | 327a36aa196177 |
12 | 106a7839039b98 |
13 | 4a72c293b1601 |
14 | 1d98231c94764 |
15 | ce6395388e42 |
hex | 65f6abff8664 |
112110122010212 has 12 divisors (see below), whose sum is σ = 196195867822080. Its totient is φ = 56054159775336.
The previous prime is 112110122010197. The next prime is 112110122010251. The reversal of 112110122010212 is 212010221011211.
It is a super-2 number, since 2×1121101220102122 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 225027512 + ... + 225525167.
It is an arithmetic number, because the mean of its divisors is an integer number (16349655651840).
Almost surely, 2112110122010212 is an apocalyptic number.
It is an amenable number.
112110122010212 is a deficient number, since it is larger than the sum of its proper divisors (84085745811868).
112110122010212 is a wasteful number, since it uses less digits than its factorization.
112110122010212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 450614890 (or 450614888 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 112110122010212 its reverse (212010221011211), we get a palindrome (324120343021423).
Subtracting 112110122010212 from its reverse (212010221011211), we obtain a palindrome (99900099000999).
The spelling of 112110122010212 in words is "one hundred twelve trillion, one hundred ten billion, one hundred twenty-two million, ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •