Base | Representation |
---|---|
bin | 1111100110000000100100… |
… | …1111100100010001100001 |
3 | 2020201002221211200121101111 |
4 | 3321200021033210101201 |
5 | 4221403310104140223 |
6 | 100244335354503321 |
7 | 3416506356535306 |
oct | 371401117442141 |
9 | 66632854617344 |
10 | 17145664521313 |
11 | 55104876aa179 |
12 | 1b0ab40434b41 |
13 | 974aa1a711a3 |
14 | 433bd6dd50ad |
15 | 1eaee87d030d |
hex | f98093e4461 |
17145664521313 has 2 divisors, whose sum is σ = 17145664521314. Its totient is φ = 17145664521312.
The previous prime is 17145664521259. The next prime is 17145664521319. The reversal of 17145664521313 is 31312546654171.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9664438477824 + 7481226043489 = 3108768^2 + 2735183^2 .
It is a cyclic number.
It is not a de Polignac number, because 17145664521313 - 229 = 17145127650401 is a prime.
It is a super-2 number, since 2×171456645213132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (17145664521319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8572832260656 + 8572832260657.
It is an arithmetic number, because the mean of its divisors is an integer number (8572832260657).
Almost surely, 217145664521313 is an apocalyptic number.
It is an amenable number.
17145664521313 is a deficient number, since it is larger than the sum of its proper divisors (1).
17145664521313 is an equidigital number, since it uses as much as digits as its factorization.
17145664521313 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1814400, while the sum is 49.
The spelling of 17145664521313 in words is "seventeen trillion, one hundred forty-five billion, six hundred sixty-four million, five hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •