Base | Representation |
---|---|
bin | 111000110111100101… |
… | …1000001010001011101 |
3 | 102200020001022101112102 |
4 | 1301233023001101131 |
5 | 4000102301302221 |
6 | 132034134214445 |
7 | 11552231642531 |
oct | 1615713012135 |
9 | 380201271472 |
10 | 122124244061 |
11 | 47879a52126 |
12 | 1b8031b4425 |
13 | b693313311 |
14 | 5ca7503bc1 |
15 | 329b70b30b |
hex | 1c6f2c145d |
122124244061 has 2 divisors, whose sum is σ = 122124244062. Its totient is φ = 122124244060.
The previous prime is 122124243961. The next prime is 122124244087. The reversal of 122124244061 is 160442421221.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 119902912900 + 2221331161 = 346270^2 + 47131^2 .
It is a cyclic number.
It is not a de Polignac number, because 122124244061 - 210 = 122124243037 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122124240061) 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, 61062122030 + 61062122031.
It is an arithmetic number, because the mean of its divisors is an integer number (61062122031).
Almost surely, 2122124244061 is an apocalyptic number.
It is an amenable number.
122124244061 is a deficient number, since it is larger than the sum of its proper divisors (1).
122124244061 is an equidigital number, since it uses as much as digits as its factorization.
122124244061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6144, while the sum is 29.
Adding to 122124244061 its reverse (160442421221), we get a palindrome (282566665282).
The spelling of 122124244061 in words is "one hundred twenty-two billion, one hundred twenty-four million, two hundred forty-four thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •