Base | Representation |
---|---|
bin | 11011100011101101001111… |
… | …110100001101010111010000 |
3 | 120220010201000120002002120201 |
4 | 123203231033310031113100 |
5 | 111341224142412241422 |
6 | 1105434551441344544 |
7 | 34346325202066042 |
oct | 3343551764152720 |
9 | 526121016062521 |
10 | 121201021212112 |
11 | 35689078852056 |
12 | 117156a0938154 |
13 | 528229046a8aa |
14 | 21d0237067a92 |
15 | e02ab3d12727 |
hex | 6e3b4fd0d5d0 |
121201021212112 has 10 divisors (see below), whose sum is σ = 234826978598498. Its totient is φ = 60600510606048.
The previous prime is 121201021212101. The next prime is 121201021212157. The reversal of 121201021212112 is 211212120102121.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 69064476734016 + 52136544478096 = 8310504^2 + 7220564^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 121201021212112.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3787531912863 + ... + 3787531912894.
Almost surely, 2121201021212112 is an apocalyptic number.
It is an amenable number.
121201021212112 is a deficient number, since it is larger than the sum of its proper divisors (113625957386386).
121201021212112 is an equidigital number, since it uses as much as digits as its factorization.
121201021212112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7575063825765 (or 7575063825759 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 121201021212112 its reverse (211212120102121), we get a palindrome (332413141314233).
It can be divided in two parts, 12120102121 and 2112, that multiplied together give a palindrome (25597655679552).
The spelling of 121201021212112 in words is "one hundred twenty-one trillion, two hundred one billion, twenty-one million, two hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •