Base | Representation |
---|---|
bin | 101011000110011000001… |
… | …110010001001011001101 |
3 | 101111010212222112102102202 |
4 | 223012120032101023031 |
5 | 342011214301003031 |
6 | 10144343104131245 |
7 | 423660553353512 |
oct | 53063016211315 |
9 | 11433788472382 |
10 | 2961786344141 |
11 | a420a51a5509 |
12 | 3ba020306b25 |
13 | 1863ab898b11 |
14 | a34cba89309 |
15 | 520999b92cb |
hex | 2b1983912cd |
2961786344141 has 2 divisors, whose sum is σ = 2961786344142. Its totient is φ = 2961786344140.
The previous prime is 2961786344123. The next prime is 2961786344203. The reversal of 2961786344141 is 1414436871692.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2268653502025 + 693132842116 = 1506205^2 + 832546^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2961786344141 is a prime.
It is a super-2 number, since 2×29617863441412 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2961786347141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1480893172070 + 1480893172071.
It is an arithmetic number, because the mean of its divisors is an integer number (1480893172071).
Almost surely, 22961786344141 is an apocalyptic number.
It is an amenable number.
2961786344141 is a deficient number, since it is larger than the sum of its proper divisors (1).
2961786344141 is an equidigital number, since it uses as much as digits as its factorization.
2961786344141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6967296, while the sum is 56.
The spelling of 2961786344141 in words is "two trillion, nine hundred sixty-one billion, seven hundred eighty-six million, three hundred forty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.883 sec. • engine limits •