Base | Representation |
---|---|
bin | 11101111000011000000011… |
… | …001011000111110100011101 |
3 | 122020022101102220220120021111 |
4 | 131320120003023013310131 |
5 | 114211120430404222034 |
6 | 1143300203204102021 |
7 | 36452412142565221 |
oct | 3570300313076435 |
9 | 566271386816244 |
10 | 131417462570269 |
11 | 38967918635a77 |
12 | 128a5702394911 |
13 | 58437c8c60875 |
14 | 24648d3a98781 |
15 | 102d70a803364 |
hex | 7786032c7d1d |
131417462570269 has 2 divisors, whose sum is σ = 131417462570270. Its totient is φ = 131417462570268.
The previous prime is 131417462570201. The next prime is 131417462570311. The reversal of 131417462570269 is 962075264714131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 94248467667225 + 37168994903044 = 9708165^2 + 6096638^2 .
It is a cyclic number.
It is not a de Polignac number, because 131417462570269 - 213 = 131417462562077 is a prime.
It is a super-2 number, since 2×1314174625702692 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131417462570369) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65708731285134 + 65708731285135.
It is an arithmetic number, because the mean of its divisors is an integer number (65708731285135).
Almost surely, 2131417462570269 is an apocalyptic number.
It is an amenable number.
131417462570269 is a deficient number, since it is larger than the sum of its proper divisors (1).
131417462570269 is an equidigital number, since it uses as much as digits as its factorization.
131417462570269 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15240960, while the sum is 58.
The spelling of 131417462570269 in words is "one hundred thirty-one trillion, four hundred seventeen billion, four hundred sixty-two million, five hundred seventy thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •