Base | Representation |
---|---|
bin | 10011100001001010101… |
… | …111100011011101101001 |
3 | 11202020002101001120211021 |
4 | 103201022233203131221 |
5 | 133433422121320421 |
6 | 2504102142132441 |
7 | 165622155662404 |
oct | 23411257433551 |
9 | 4666071046737 |
10 | 1341283776361 |
11 | 4779207a7431 |
12 | 197b49281121 |
13 | 99637124389 |
14 | 48cc0452d3b |
15 | 24d53495341 |
hex | 1384abe3769 |
1341283776361 has 8 divisors (see below), whose sum is σ = 1345529296904. Its totient is φ = 1337039827200.
The previous prime is 1341283776341. The next prime is 1341283776421. The reversal of 1341283776361 is 1636773821431.
It can be written as a sum of positive squares in 4 ways, for example, as 782936361 + 1340500840000 = 27981^2 + 1157800^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1341283776361 - 225 = 1341250221929 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1341283776299 and 1341283776308.
It is not an unprimeable number, because it can be changed into a prime (1341283776341) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1328911 + ... + 2109163.
It is an arithmetic number, because the mean of its divisors is an integer number (168191162113).
Almost surely, 21341283776361 is an apocalyptic number.
It is an amenable number.
1341283776361 is a deficient number, since it is larger than the sum of its proper divisors (4245520543).
1341283776361 is an equidigital number, since it uses as much as digits as its factorization.
1341283776361 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 785691.
The product of its digits is 3048192, while the sum is 52.
The spelling of 1341283776361 in words is "one trillion, three hundred forty-one billion, two hundred eighty-three million, seven hundred seventy-six thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •