Base | Representation |
---|---|
bin | 111000110110111001… |
… | …0101111001011011101 |
3 | 102200011102202121121021 |
4 | 1301231302233023131 |
5 | 4000030340220102 |
6 | 132031550204141 |
7 | 11551531144051 |
oct | 1615562571335 |
9 | 380142677537 |
10 | 122101101277 |
11 | 47867985661 |
12 | 1b7b74b3651 |
13 | b68b59c56c |
14 | 5ca43dbc61 |
15 | 3299689137 |
hex | 1c6dcaf2dd |
122101101277 has 2 divisors, whose sum is σ = 122101101278. Its totient is φ = 122101101276.
The previous prime is 122101101197. The next prime is 122101101313. The reversal of 122101101277 is 772101101221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 118288532761 + 3812568516 = 343931^2 + 61746^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122101101277 is a prime.
It is a super-2 number, since 2×1221011012772 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122101107277) 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, 61050550638 + 61050550639.
It is an arithmetic number, because the mean of its divisors is an integer number (61050550639).
Almost surely, 2122101101277 is an apocalyptic number.
It is an amenable number.
122101101277 is a deficient number, since it is larger than the sum of its proper divisors (1).
122101101277 is an equidigital number, since it uses as much as digits as its factorization.
122101101277 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 392, while the sum is 25.
Adding to 122101101277 its reverse (772101101221), we get a palindrome (894202202498).
The spelling of 122101101277 in words is "one hundred twenty-two billion, one hundred one million, one hundred one thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •