Base | Representation |
---|---|
bin | 1011100111101100100100… |
… | …0000011101110010111001 |
3 | 1200020102122120112210211202 |
4 | 2321323021000131302321 |
5 | 3133312441400041021 |
6 | 43101254044103545 |
7 | 2456036120203634 |
oct | 271731100356271 |
9 | 50212576483752 |
10 | 12776605080761 |
11 | 40865895344a5 |
12 | 1524237234bb5 |
13 | 718aa0827282 |
14 | 322568c14c1b |
15 | 1725373e4a0b |
hex | b9ec901dcb9 |
12776605080761 has 2 divisors, whose sum is σ = 12776605080762. Its totient is φ = 12776605080760.
The previous prime is 12776605080749. The next prime is 12776605080779. The reversal of 12776605080761 is 16708050667721.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11966452073536 + 810153007225 = 3459256^2 + 900085^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12776605080761 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12776605080697 and 12776605080706.
It is not a weakly prime, because it can be changed into another prime (12776605083761) 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, 6388302540380 + 6388302540381.
It is an arithmetic number, because the mean of its divisors is an integer number (6388302540381).
Almost surely, 212776605080761 is an apocalyptic number.
It is an amenable number.
12776605080761 is a deficient number, since it is larger than the sum of its proper divisors (1).
12776605080761 is an equidigital number, since it uses as much as digits as its factorization.
12776605080761 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5927040, while the sum is 56.
The spelling of 12776605080761 in words is "twelve trillion, seven hundred seventy-six billion, six hundred five million, eighty thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •