Base | Representation |
---|---|
bin | 11011100011110101101110… |
… | …010001010110000111100101 |
3 | 120220011120111211000011102201 |
4 | 123203311232101112013211 |
5 | 111341401312224214341 |
6 | 1105443054505134501 |
7 | 34350066551264326 |
oct | 3343655621260745 |
9 | 526146454004381 |
10 | 121210122101221 |
11 | 35691a18a9180a |
12 | 1171740078a431 |
13 | 52830b0ab328a |
14 | 21d085ba2244d |
15 | e02e47cbc331 |
hex | 6e3d6e4561e5 |
121210122101221 has 2 divisors, whose sum is σ = 121210122101222. Its totient is φ = 121210122101220.
The previous prime is 121210122101197. The next prime is 121210122101231. The reversal of 121210122101221 is 122101221012121.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105205761804196 + 16004360297025 = 10256986^2 + 4000545^2 .
It is a cyclic number.
It is not a de Polignac number, because 121210122101221 - 233 = 121201532166629 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121210122101231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60605061050610 + 60605061050611.
It is an arithmetic number, because the mean of its divisors is an integer number (60605061050611).
Almost surely, 2121210122101221 is an apocalyptic number.
It is an amenable number.
121210122101221 is a deficient number, since it is larger than the sum of its proper divisors (1).
121210122101221 is an equidigital number, since it uses as much as digits as its factorization.
121210122101221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 121210122101221 its reverse (122101221012121), we get a palindrome (243311343113342).
The spelling of 121210122101221 in words is "one hundred twenty-one trillion, two hundred ten billion, one hundred twenty-two million, one hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •