Base | Representation |
---|---|
bin | 11011110111011010011101… |
… | …000010100110111001101001 |
3 | 121001221011110210201001121112 |
4 | 123313122131002212321221 |
5 | 112030421103232434401 |
6 | 1112353032432320105 |
7 | 34546215612631262 |
oct | 3367323502467151 |
9 | 531834423631545 |
10 | 122555231530601 |
11 | 36060422210951 |
12 | 118b40370a3035 |
13 | 534cba768425c |
14 | 22399c21a3969 |
15 | e27e220493bb |
hex | 6f769d0a6e69 |
122555231530601 has 2 divisors, whose sum is σ = 122555231530602. Its totient is φ = 122555231530600.
The previous prime is 122555231530549. The next prime is 122555231530603. The reversal of 122555231530601 is 106035132555221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 114252903877225 + 8302327653376 = 10688915^2 + 2881376^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122555231530601 is a prime.
It is a Sophie Germain prime.
Together with 122555231530603, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (122555231530603) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61277615765300 + 61277615765301.
It is an arithmetic number, because the mean of its divisors is an integer number (61277615765301).
Almost surely, 2122555231530601 is an apocalyptic number.
It is an amenable number.
122555231530601 is a deficient number, since it is larger than the sum of its proper divisors (1).
122555231530601 is an equidigital number, since it uses as much as digits as its factorization.
122555231530601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270000, while the sum is 41.
The spelling of 122555231530601 in words is "one hundred twenty-two trillion, five hundred fifty-five billion, two hundred thirty-one million, five hundred thirty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •