Base | Representation |
---|---|
bin | 11011100100001001010000… |
… | …110010000111010010011011 |
3 | 120220020120122221210011212001 |
4 | 123210021100302013102123 |
5 | 111342222244131224402 |
6 | 1105500444405501431 |
7 | 34351441504261651 |
oct | 3344112062072233 |
9 | 526216587704761 |
10 | 121231102211227 |
11 | 3569a9047899a8 |
12 | 1171b496a11877 |
13 | 5285075552a58 |
14 | 21d188c158dd1 |
15 | e03774adb187 |
hex | 6e4250c8749b |
121231102211227 has 2 divisors, whose sum is σ = 121231102211228. Its totient is φ = 121231102211226.
The previous prime is 121231102211147. The next prime is 121231102211353. The reversal of 121231102211227 is 722112201132121.
It is a weak prime.
It is an emirp because it is prime and its reverse (722112201132121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 121231102211227 - 27 = 121231102211099 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121231102211195 and 121231102211204.
It is not a weakly prime, because it can be changed into another prime (121231102211627) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60615551105613 + 60615551105614.
It is an arithmetic number, because the mean of its divisors is an integer number (60615551105614).
Almost surely, 2121231102211227 is an apocalyptic number.
121231102211227 is a deficient number, since it is larger than the sum of its proper divisors (1).
121231102211227 is an equidigital number, since it uses as much as digits as its factorization.
121231102211227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1344, while the sum is 28.
Adding to 121231102211227 its reverse (722112201132121), we get a palindrome (843343303343348).
The spelling of 121231102211227 in words is "one hundred twenty-one trillion, two hundred thirty-one billion, one hundred two million, two hundred eleven thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •