Base | Representation |
---|---|
bin | 11011110111011010011101… |
… | …001100100010110101110101 |
3 | 121001221011110222121101202001 |
4 | 123313122131030202311311 |
5 | 112030421104414313123 |
6 | 1112353033004215301 |
7 | 34546215644030422 |
oct | 3367323514426565 |
9 | 531834428541661 |
10 | 122555234135413 |
11 | 3606042372a992 |
12 | 118b4037b3a531 |
13 | 534cba8086a71 |
14 | 22399c2680d49 |
15 | e27e223b10ad |
hex | 6f769d322d75 |
122555234135413 has 2 divisors, whose sum is σ = 122555234135414. Its totient is φ = 122555234135412.
The previous prime is 122555234135329. The next prime is 122555234135431. The reversal of 122555234135413 is 314531432555221.
Together with next prime (122555234135431) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105738484858084 + 16816749277329 = 10282922^2 + 4100823^2 .
It is a cyclic number.
It is not a de Polignac number, because 122555234135413 - 229 = 122554697264501 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122555234835413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61277617067706 + 61277617067707.
It is an arithmetic number, because the mean of its divisors is an integer number (61277617067707).
Almost surely, 2122555234135413 is an apocalyptic number.
It is an amenable number.
122555234135413 is a deficient number, since it is larger than the sum of its proper divisors (1).
122555234135413 is an equidigital number, since it uses as much as digits as its factorization.
122555234135413 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2160000, while the sum is 46.
The spelling of 122555234135413 in words is "one hundred twenty-two trillion, five hundred fifty-five billion, two hundred thirty-four million, one hundred thirty-five thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •