Base | Representation |
---|---|
bin | 11101111101101101100010… |
… | …110110110101010111000101 |
3 | 122021121102220022100021111021 |
4 | 131331231202312311113011 |
5 | 114233122404330202202 |
6 | 1144140444223511141 |
7 | 36521042562204403 |
oct | 3575554266652705 |
9 | 567542808307437 |
10 | 131784140084677 |
11 | 38a99381521783 |
12 | 12944795a584b1 |
13 | 586c263a80bc2 |
14 | 247855a462473 |
15 | 103801ba7ca37 |
hex | 77db62db55c5 |
131784140084677 has 2 divisors, whose sum is σ = 131784140084678. Its totient is φ = 131784140084676.
The previous prime is 131784140084621. The next prime is 131784140084713. The reversal of 131784140084677 is 776480041487131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 129984761979396 + 1799378105281 = 11401086^2 + 1341409^2 .
It is a cyclic number.
It is not a de Polignac number, because 131784140084677 - 211 = 131784140082629 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131784140184677) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65892070042338 + 65892070042339.
It is an arithmetic number, because the mean of its divisors is an integer number (65892070042339).
Almost surely, 2131784140084677 is an apocalyptic number.
It is an amenable number.
131784140084677 is a deficient number, since it is larger than the sum of its proper divisors (1).
131784140084677 is an equidigital number, since it uses as much as digits as its factorization.
131784140084677 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25288704, while the sum is 61.
The spelling of 131784140084677 in words is "one hundred thirty-one trillion, seven hundred eighty-four billion, one hundred forty million, eighty-four thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •