Base | Representation |
---|---|
bin | 1011100111101100100100… |
… | …0000011101110010101101 |
3 | 1200020102122120112210211022 |
4 | 2321323021000131302231 |
5 | 3133312441400040444 |
6 | 43101254044103525 |
7 | 2456036120203616 |
oct | 271731100356255 |
9 | 50212576483738 |
10 | 12776605080749 |
11 | 4086589534494 |
12 | 1524237234ba5 |
13 | 718aa0827273 |
14 | 322568c14c0d |
15 | 1725373e49ee |
hex | b9ec901dcad |
12776605080749 has 2 divisors, whose sum is σ = 12776605080750. Its totient is φ = 12776605080748.
The previous prime is 12776605080719. The next prime is 12776605080761. The reversal of 12776605080749 is 94708050667721.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10356122556649 + 2420482524100 = 3218093^2 + 1555790^2 .
It is a cyclic number.
It is not a de Polignac number, because 12776605080749 - 28 = 12776605080493 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12776605080691 and 12776605080700.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12776605080709) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6388302540374 + 6388302540375.
It is an arithmetic number, because the mean of its divisors is an integer number (6388302540375).
Almost surely, 212776605080749 is an apocalyptic number.
It is an amenable number.
12776605080749 is a deficient number, since it is larger than the sum of its proper divisors (1).
12776605080749 is an equidigital number, since it uses as much as digits as its factorization.
12776605080749 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 35562240, while the sum is 62.
The spelling of 12776605080749 in words is "twelve trillion, seven hundred seventy-six billion, six hundred five million, eighty thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •