Base | Representation |
---|---|
bin | 11111011000011011000100… |
… | …100010101110110010000101 |
3 | 200002200101000011001220102012 |
4 | 133120123010202232302011 |
5 | 121042240401242403032 |
6 | 1205312254034424005 |
7 | 41033312110550534 |
oct | 3730330442566205 |
9 | 602611004056365 |
10 | 138017776528517 |
11 | 3aa82012809446 |
12 | 1359092a132005 |
13 | 5c02035cc5072 |
14 | 261214b6d631b |
15 | 10e525be736b2 |
hex | 7d86c48aec85 |
138017776528517 has 2 divisors, whose sum is σ = 138017776528518. Its totient is φ = 138017776528516.
The previous prime is 138017776528477. The next prime is 138017776528547. The reversal of 138017776528517 is 715825677710831.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83219896780036 + 54797879748481 = 9122494^2 + 7402559^2 .
It is a cyclic number.
It is not a de Polignac number, because 138017776528517 - 224 = 138017759751301 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (138017776528547) 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, 69008888264258 + 69008888264259.
It is an arithmetic number, because the mean of its divisors is an integer number (69008888264259).
Almost surely, 2138017776528517 is an apocalyptic number.
It is an amenable number.
138017776528517 is a deficient number, since it is larger than the sum of its proper divisors (1).
138017776528517 is an equidigital number, since it uses as much as digits as its factorization.
138017776528517 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 138297600, while the sum is 68.
The spelling of 138017776528517 in words is "one hundred thirty-eight trillion, seventeen billion, seven hundred seventy-six million, five hundred twenty-eight thousand, five hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •