Base | Representation |
---|---|
bin | 11101110110101101100011… |
… | …010110110011111001111011 |
3 | 122012220110021122101100000101 |
4 | 131312231203112303321323 |
5 | 114202232233201131141 |
6 | 1143131452245220231 |
7 | 36441223344102022 |
oct | 3566554326637173 |
9 | 565813248340011 |
10 | 131303112130171 |
11 | 38923378806923 |
12 | 1288750a701677 |
13 | 5835aa4363967 |
14 | 245d166bbb8b9 |
15 | 102a766811531 |
hex | 776b635b3e7b |
131303112130171 has 2 divisors, whose sum is σ = 131303112130172. Its totient is φ = 131303112130170.
The previous prime is 131303112130139. The next prime is 131303112130283. The reversal of 131303112130171 is 171031211303131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 131303112130171 - 25 = 131303112130139 is a prime.
It is not a weakly prime, because it can be changed into another prime (131303512130171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65651556065085 + 65651556065086.
It is an arithmetic number, because the mean of its divisors is an integer number (65651556065086).
Almost surely, 2131303112130171 is an apocalyptic number.
131303112130171 is a deficient number, since it is larger than the sum of its proper divisors (1).
131303112130171 is an equidigital number, since it uses as much as digits as its factorization.
131303112130171 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 28.
The spelling of 131303112130171 in words is "one hundred thirty-one trillion, three hundred three billion, one hundred twelve million, one hundred thirty thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •