Base | Representation |
---|---|
bin | 11011110100001001110001… |
… | …000011101011000100111101 |
3 | 121001010202002112202210110112 |
4 | 123310021301003223010331 |
5 | 112013233201230003312 |
6 | 1112102053521315405 |
7 | 34524064032333023 |
oct | 3364116103530475 |
9 | 531122075683415 |
10 | 122331155312957 |
11 | 35a8439600a018 |
12 | 11878720495b65 |
13 | 5334a17331166 |
14 | 222cc066c6713 |
15 | e221aa07ad22 |
hex | 6f42710eb13d |
122331155312957 has 2 divisors, whose sum is σ = 122331155312958. Its totient is φ = 122331155312956.
The previous prime is 122331155312941. The next prime is 122331155312969. The reversal of 122331155312957 is 759213551133221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 119825665213081 + 2505490099876 = 10946491^2 + 1582874^2 .
It is a cyclic number.
It is not a de Polignac number, because 122331155312957 - 24 = 122331155312941 is a prime.
It is a super-2 number, since 2×1223311553129572 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122331155312357) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61165577656478 + 61165577656479.
It is an arithmetic number, because the mean of its divisors is an integer number (61165577656479).
Almost surely, 2122331155312957 is an apocalyptic number.
It is an amenable number.
122331155312957 is a deficient number, since it is larger than the sum of its proper divisors (1).
122331155312957 is an equidigital number, since it uses as much as digits as its factorization.
122331155312957 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1701000, while the sum is 50.
The spelling of 122331155312957 in words is "one hundred twenty-two trillion, three hundred thirty-one billion, one hundred fifty-five million, three hundred twelve thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •