Base | Representation |
---|---|
bin | 11011100011110110101111… |
… | …101101111101010111000011 |
3 | 120220011200100100010100102221 |
4 | 123203312233231331113003 |
5 | 111341411034322333102 |
6 | 1105443355451351511 |
7 | 34350136013302261 |
oct | 3343665755752703 |
9 | 526150310110387 |
10 | 121211220121027 |
11 | 356924318742a3 |
12 | 11717668452597 |
13 | 528322741c83a |
14 | 21d09237a7431 |
15 | e02eae3b1637 |
hex | 6e3dafb7d5c3 |
121211220121027 has 2 divisors, whose sum is σ = 121211220121028. Its totient is φ = 121211220121026.
The previous prime is 121211220121009. The next prime is 121211220121039. The reversal of 121211220121027 is 720121022112121.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 121211220121027 - 219 = 121211219596739 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121211220120992 and 121211220121010.
It is not a weakly prime, because it can be changed into another prime (121211220121087) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60605610060513 + 60605610060514.
It is an arithmetic number, because the mean of its divisors is an integer number (60605610060514).
Almost surely, 2121211220121027 is an apocalyptic number.
121211220121027 is a deficient number, since it is larger than the sum of its proper divisors (1).
121211220121027 is an equidigital number, since it uses as much as digits as its factorization.
121211220121027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 448, while the sum is 25.
Adding to 121211220121027 its reverse (720121022112121), we get a palindrome (841332242233148).
The spelling of 121211220121027 in words is "one hundred twenty-one trillion, two hundred eleven billion, two hundred twenty million, one hundred twenty-one thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •