Base | Representation |
---|---|
bin | 10011001011010010110… |
… | …100001011001011111001 |
3 | 11122222110112022220011222 |
4 | 103023102310023023321 |
5 | 133042322000311431 |
6 | 2445215412401425 |
7 | 164131143464234 |
oct | 23132264131371 |
9 | 4588415286158 |
10 | 1317796885241 |
11 | 468968a94511 |
12 | 193493616275 |
13 | 9736321ca75 |
14 | 47ad302241b |
15 | 2442b55b57b |
hex | 132d2d0b2f9 |
1317796885241 has 2 divisors, whose sum is σ = 1317796885242. Its totient is φ = 1317796885240.
The previous prime is 1317796885217. The next prime is 1317796885243. The reversal of 1317796885241 is 1425886977131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 972188112016 + 345608773225 = 985996^2 + 587885^2 .
It is a cyclic number.
It is not a de Polignac number, because 1317796885241 - 26 = 1317796885177 is a prime.
It is a super-3 number, since 3×13177968852413 (a number of 37 digits) contains 333 as substring.
It is a Sophie Germain prime.
Together with 1317796885243, 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 (1317796885243) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 658898442620 + 658898442621.
It is an arithmetic number, because the mean of its divisors is an integer number (658898442621).
Almost surely, 21317796885241 is an apocalyptic number.
It is an amenable number.
1317796885241 is a deficient number, since it is larger than the sum of its proper divisors (1).
1317796885241 is an equidigital number, since it uses as much as digits as its factorization.
1317796885241 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 20321280, while the sum is 62.
The spelling of 1317796885241 in words is "one trillion, three hundred seventeen billion, seven hundred ninety-six million, eight hundred eighty-five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •