Base | Representation |
---|---|
bin | 11101110100010110111100… |
… | …110001000000001011100101 |
3 | 122012022222212212220021012122 |
4 | 131310112330301000023211 |
5 | 114142110043233124143 |
6 | 1142525310134155325 |
7 | 36423440141500541 |
oct | 3564267461001345 |
9 | 565288785807178 |
10 | 131141403411173 |
11 | 38870836415901 |
12 | 128600ba7b2b45 |
13 | 58237730b700c |
14 | 24553c6392a21 |
15 | 102644ed4bc68 |
hex | 7745bcc402e5 |
131141403411173 has 2 divisors, whose sum is σ = 131141403411174. Its totient is φ = 131141403411172.
The previous prime is 131141403411167. The next prime is 131141403411259. The reversal of 131141403411173 is 371114304141131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 113068302356164 + 18073101055009 = 10633358^2 + 4251247^2 .
It is a cyclic number.
It is not a de Polignac number, because 131141403411173 - 28 = 131141403410917 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131141403411973) 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, 65570701705586 + 65570701705587.
It is an arithmetic number, because the mean of its divisors is an integer number (65570701705587).
Almost surely, 2131141403411173 is an apocalyptic number.
It is an amenable number.
131141403411173 is a deficient number, since it is larger than the sum of its proper divisors (1).
131141403411173 is an equidigital number, since it uses as much as digits as its factorization.
131141403411173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12096, while the sum is 35.
The spelling of 131141403411173 in words is "one hundred thirty-one trillion, one hundred forty-one billion, four hundred three million, four hundred eleven thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •