Base | Representation |
---|---|
bin | 11101110100010110111001… |
… | …000110110110111000001101 |
3 | 122012022222201121101211221201 |
4 | 131310112321012312320031 |
5 | 114142104432030000443 |
6 | 1142525300102425501 |
7 | 36423435464665642 |
oct | 3564267106667015 |
9 | 565288647354851 |
10 | 131141342031373 |
11 | 388708048022a3 |
12 | 128600a2132291 |
13 | 5823763475ccb |
14 | 24553bc175dc9 |
15 | 102644977534d |
hex | 7745b91b6e0d |
131141342031373 has 2 divisors, whose sum is σ = 131141342031374. Its totient is φ = 131141342031372.
The previous prime is 131141342031331. The next prime is 131141342031379. The reversal of 131141342031373 is 373130243141131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 116061773600809 + 15079568430564 = 10773197^2 + 3883242^2 .
It is a cyclic number.
It is not a de Polignac number, because 131141342031373 - 29 = 131141342030861 is a prime.
It is a super-2 number, since 2×1311413420313732 (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 (131141342031379) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65570671015686 + 65570671015687.
It is an arithmetic number, because the mean of its divisors is an integer number (65570671015687).
Almost surely, 2131141342031373 is an apocalyptic number.
It is an amenable number.
131141342031373 is a deficient number, since it is larger than the sum of its proper divisors (1).
131141342031373 is an equidigital number, since it uses as much as digits as its factorization.
131141342031373 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 54432, while the sum is 37.
The spelling of 131141342031373 in words is "one hundred thirty-one trillion, one hundred forty-one billion, three hundred forty-two million, thirty-one thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •