Base | Representation |
---|---|
bin | 10011001001110110010… |
… | …100101101010011111101 |
3 | 11122211110101102200122202 |
4 | 103021312110231103331 |
5 | 133031132223220131 |
6 | 2444401421121245 |
7 | 164044532012003 |
oct | 23116624552375 |
9 | 4584411380582 |
10 | 1316245132541 |
11 | 468242076769 |
12 | 19311b9b9225 |
13 | 971768aa6c1 |
14 | 479c6ccaa73 |
15 | 2438a1dcbcb |
hex | 1327652d4fd |
1316245132541 has 2 divisors, whose sum is σ = 1316245132542. Its totient is φ = 1316245132540.
The previous prime is 1316245132523. The next prime is 1316245132547. The reversal of 1316245132541 is 1452315426131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 667824012025 + 648421120516 = 817205^2 + 805246^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1316245132541 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1316245132495 and 1316245132504.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1316245132547) 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, 658122566270 + 658122566271.
It is an arithmetic number, because the mean of its divisors is an integer number (658122566271).
Almost surely, 21316245132541 is an apocalyptic number.
It is an amenable number.
1316245132541 is a deficient number, since it is larger than the sum of its proper divisors (1).
1316245132541 is an equidigital number, since it uses as much as digits as its factorization.
1316245132541 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 86400, while the sum is 38.
The spelling of 1316245132541 in words is "one trillion, three hundred sixteen billion, two hundred forty-five million, one hundred thirty-two thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •