Base | Representation |
---|---|
bin | 11011100000111011100010… |
… | …101100110111110001101000 |
3 | 120212110110111201220101010021 |
4 | 123200323202230313301220 |
5 | 111330112403233323422 |
6 | 1105211153550130224 |
7 | 34326461601456304 |
oct | 3340734254676150 |
9 | 525413451811107 |
10 | 121010212011112 |
11 | 35615162a50206 |
12 | 116a470b1b0974 |
13 | 526a2a22b4028 |
14 | 21c4cd5866d04 |
15 | decb476a7dc7 |
hex | 6e0ee2b37c68 |
121010212011112 has 8 divisors (see below), whose sum is σ = 226894147520850. Its totient is φ = 60505106005552.
The previous prime is 121010212011097. The next prime is 121010212011149. The reversal of 121010212011112 is 211110212010121.
It can be written as a sum of positive squares in only one way, i.e., 119859711218116 + 1150500792996 = 10948046^2 + 1072614^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×1210102120111122 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7563138250687 + ... + 7563138250702.
Almost surely, 2121010212011112 is an apocalyptic number.
It is an amenable number.
121010212011112 is a deficient number, since it is larger than the sum of its proper divisors (105883935509738).
121010212011112 is a wasteful number, since it uses less digits than its factorization.
121010212011112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15126276501395 (or 15126276501391 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 121010212011112 its reverse (211110212010121), we get a palindrome (332120424021233).
Subtracting 121010212011112 from its reverse (211110212010121), we obtain a palindrome (90099999999009).
The spelling of 121010212011112 in words is "one hundred twenty-one trillion, ten billion, two hundred twelve million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •