Search a number
-
+
1276766315161 is a prime number
BaseRepresentation
bin10010100101000101001…
…100111110001010011001
311112001120001001222022021
4102211011030332022121
5131404304134041121
62414312141054441
7161146313421031
oct22450514761231
94461501058267
101276766315161
11452523332967
12187542557421
13935247b8a2c
1445b1da2a8c1
1523329355641
hex1294533e299

1276766315161 has 2 divisors, whose sum is σ = 1276766315162. Its totient is φ = 1276766315160.

The previous prime is 1276766315089. The next prime is 1276766315173. The reversal of 1276766315161 is 1615136676721.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1055922711561 + 220843603600 = 1027581^2 + 469940^2 .

It is a cyclic number.

It is not a de Polignac number, because 1276766315161 - 213 = 1276766306969 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 1276766315099 and 1276766315108.

It is not a weakly prime, because it can be changed into another prime (1276766318161) 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, 638383157580 + 638383157581.

It is an arithmetic number, because the mean of its divisors is an integer number (638383157581).

Almost surely, 21276766315161 is an apocalyptic number.

It is an amenable number.

1276766315161 is a deficient number, since it is larger than the sum of its proper divisors (1).

1276766315161 is an equidigital number, since it uses as much as digits as its factorization.

1276766315161 is an odious number, because the sum of its binary digits is odd.

The product of its digits is 1905120, while the sum is 52.

The spelling of 1276766315161 in words is "one trillion, two hundred seventy-six billion, seven hundred sixty-six million, three hundred fifteen thousand, one hundred sixty-one".