Base | Representation |
---|---|
bin | 111000011001011010… |
… | …1101010000101101000 |
3 | 102120121111121121222012 |
4 | 1300302311222011220 |
5 | 3441014133323422 |
6 | 131345454415052 |
7 | 11515161052211 |
oct | 1606265520550 |
9 | 376544547865 |
10 | 121112011112 |
11 | 473aa633574 |
12 | 1b580201488 |
13 | b5616b2101 |
14 | 5c0ccd0408 |
15 | 323c9104e2 |
hex | 1c32d6a168 |
121112011112 has 32 divisors (see below), whose sum is σ = 229208502600. Its totient is φ = 59989939200.
The previous prime is 121112011103. The next prime is 121112011121. The reversal of 121112011112 is 211110211121.
It is an interprime number because it is at equal distance from previous prime (121112011103) and next prime (121112011121).
It can be written as a sum of positive squares in 4 ways, for example, as 106938156196 + 14173854916 = 327014^2 + 119054^2 .
It is a super-2 number, since 2×1211120111122 (a number of 23 digits) contains 22 as substring.
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 7 ways as a sum of consecutive naturals, for example, 7980812 + ... + 7995972.
Almost surely, 2121112011112 is an apocalyptic number.
It is an amenable number.
121112011112 is a deficient number, since it is larger than the sum of its proper divisors (108096491488).
121112011112 is a wasteful number, since it uses less digits than its factorization.
121112011112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24437 (or 24433 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 121112011112 its reverse (211110211121), we get a palindrome (332222222233).
Subtracting 121112011112 from its reverse (211110211121), we obtain a square (89998200009 = 2999972).
The spelling of 121112011112 in words is "one hundred twenty-one billion, one hundred twelve million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •