Base | Representation |
---|---|
bin | 11011100011110101101110… |
… | …001010001001000101011101 |
3 | 120220011120111200110020001021 |
4 | 123203311232022021011131 |
5 | 111341401311233302304 |
6 | 1105443054400444141 |
7 | 34350066526240654 |
oct | 3343655612110535 |
9 | 526146450406037 |
10 | 121210120212829 |
11 | 35691a17a11a5a |
12 | 11717400019651 |
13 | 52830b05a189b |
14 | 21d085b69019b |
15 | e02e47a47a54 |
hex | 6e3d6e28915d |
121210120212829 has 2 divisors, whose sum is σ = 121210120212830. Its totient is φ = 121210120212828.
The previous prime is 121210120212821. The next prime is 121210120212833. The reversal of 121210120212829 is 928212021012121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 120956597892729 + 253522320100 = 10998027^2 + 503510^2 .
It is a cyclic number.
It is not a de Polignac number, because 121210120212829 - 23 = 121210120212821 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121210120212794 and 121210120212803.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121210120212821) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60605060106414 + 60605060106415.
It is an arithmetic number, because the mean of its divisors is an integer number (60605060106415).
Almost surely, 2121210120212829 is an apocalyptic number.
It is an amenable number.
121210120212829 is a deficient number, since it is larger than the sum of its proper divisors (1).
121210120212829 is an equidigital number, since it uses as much as digits as its factorization.
121210120212829 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 34.
The spelling of 121210120212829 in words is "one hundred twenty-one trillion, two hundred ten billion, one hundred twenty million, two hundred twelve thousand, eight hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •