Base | Representation |
---|---|
bin | 111000111010110111… |
… | …1011100011001101101 |
3 | 102200111201200201102112 |
4 | 1301311233130121231 |
5 | 4000314010040121 |
6 | 132053112333405 |
7 | 11555040505253 |
oct | 1616557343155 |
9 | 380451621375 |
10 | 122234455661 |
11 | 4792618879a |
12 | 1b8340a4265 |
13 | b6b00c0a96 |
14 | 5cb7dd25d3 |
15 | 32a622b75b |
hex | 1c75bdc66d |
122234455661 has 2 divisors, whose sum is σ = 122234455662. Its totient is φ = 122234455660.
The previous prime is 122234455549. The next prime is 122234455663. The reversal of 122234455661 is 166554432221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 121905722500 + 328733161 = 349150^2 + 18131^2 .
It is a cyclic number.
It is not a de Polignac number, because 122234455661 - 210 = 122234454637 is a prime.
Together with 122234455663, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122234455663) 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, 61117227830 + 61117227831.
It is an arithmetic number, because the mean of its divisors is an integer number (61117227831).
Almost surely, 2122234455661 is an apocalyptic number.
It is an amenable number.
122234455661 is a deficient number, since it is larger than the sum of its proper divisors (1).
122234455661 is an equidigital number, since it uses as much as digits as its factorization.
122234455661 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 345600, while the sum is 41.
Adding to 122234455661 its reverse (166554432221), we get a palindrome (288788887882).
The spelling of 122234455661 in words is "one hundred twenty-two billion, two hundred thirty-four million, four hundred fifty-five thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •