Base | Representation |
---|---|
bin | 11011100000110010000010… |
… | …000100111111110110110001 |
3 | 120212102111011010002211102102 |
4 | 123200302002010333312301 |
5 | 111324431000224323441 |
6 | 1105202344425030145 |
7 | 34325650552424111 |
oct | 3340620204776661 |
9 | 525374133084372 |
10 | 121000001011121 |
11 | 356108a311a841 |
12 | 116a273b625355 |
13 | 526933598a7bb |
14 | 21c460769b041 |
15 | dec74b01b69b |
hex | 6e0c8213fdb1 |
121000001011121 has 2 divisors, whose sum is σ = 121000001011122. Its totient is φ = 121000001011120.
The previous prime is 121000001011111. The next prime is 121000001011129. The reversal of 121000001011121 is 121110100000121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99677540370496 + 21322460640625 = 9983864^2 + 4617625^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121000001011121 is a prime.
It is not a weakly prime, because it can be changed into another prime (121000001011129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60500000505560 + 60500000505561.
It is an arithmetic number, because the mean of its divisors is an integer number (60500000505561).
Almost surely, 2121000001011121 is an apocalyptic number.
It is an amenable number.
121000001011121 is a deficient number, since it is larger than the sum of its proper divisors (1).
121000001011121 is an equidigital number, since it uses as much as digits as its factorization.
121000001011121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 121000001011121 its reverse (121110100000121), we get a palindrome (242110101011242).
The spelling of 121000001011121 in words is "one hundred twenty-one trillion, one million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •