Base | Representation |
---|---|
bin | 10001101000000001110… |
… | …111100001100100101111 |
3 | 11021210100110021022121111 |
4 | 101220001313201210233 |
5 | 124321030300011002 |
6 | 2324231223012451 |
7 | 153335652031525 |
oct | 21500167414457 |
9 | 4253313238544 |
10 | 1211212110127 |
11 | 427743729408 |
12 | 1768a859a127 |
13 | 8a2a84497b6 |
14 | 428a1650315 |
15 | 2178e1c73d7 |
hex | 11a01de192f |
1211212110127 has 2 divisors, whose sum is σ = 1211212110128. Its totient is φ = 1211212110126.
The previous prime is 1211212110089. The next prime is 1211212110161. The reversal of 1211212110127 is 7210112121121.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1211212110127 - 27 = 1211212109999 is a prime.
It is a super-2 number, since 2×12112121101272 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1211212110098 and 1211212110107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1211212110187) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 605606055063 + 605606055064.
It is an arithmetic number, because the mean of its divisors is an integer number (605606055064).
Almost surely, 21211212110127 is an apocalyptic number.
1211212110127 is a deficient number, since it is larger than the sum of its proper divisors (1).
1211212110127 is an equidigital number, since it uses as much as digits as its factorization.
1211212110127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 22.
Adding to 1211212110127 its reverse (7210112121121), we get a palindrome (8421324231248).
The spelling of 1211212110127 in words is "one trillion, two hundred eleven billion, two hundred twelve million, one hundred ten thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •