Base | Representation |
---|---|
bin | 11101110101011000001110… |
… | …111000001001011110101001 |
3 | 122012120200211001220221220211 |
4 | 131311120032320021132221 |
5 | 114144232123111231323 |
6 | 1143021421534021121 |
7 | 36431501205036004 |
oct | 3565301670113651 |
9 | 565520731827824 |
10 | 131211500492713 |
11 | 38898537395753 |
12 | 128718020477a1 |
13 | 582a264692964 |
14 | 2458955c3a53b |
15 | 10281a3c3770d |
hex | 77560ee097a9 |
131211500492713 has 2 divisors, whose sum is σ = 131211500492714. Its totient is φ = 131211500492712.
The previous prime is 131211500492689. The next prime is 131211500492719. The reversal of 131211500492713 is 317294005112131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 81914138713449 + 49297361779264 = 9050643^2 + 7021208^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131211500492713 is a prime.
It is a super-3 number, since 3×1312115004927133 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (131211500492719) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65605750246356 + 65605750246357.
It is an arithmetic number, because the mean of its divisors is an integer number (65605750246357).
Almost surely, 2131211500492713 is an apocalyptic number.
It is an amenable number.
131211500492713 is a deficient number, since it is larger than the sum of its proper divisors (1).
131211500492713 is an equidigital number, since it uses as much as digits as its factorization.
131211500492713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45360, while the sum is 40.
The spelling of 131211500492713 in words is "one hundred thirty-one trillion, two hundred eleven billion, five hundred million, four hundred ninety-two thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •