Search a number
-
+
77295769361 is a prime number
BaseRepresentation
bin100011111111100101…
…1111101011100010001
321101111212121220221122
41013333023331130101
52231300204104421
655301552332025
75404314125156
oct1077713753421
9241455556848
1077295769361
112a8654a0628
1212b92244015
13739aac9845
143a5396422d
152025da02ab
hex11ff2fd711

77295769361 has 2 divisors, whose sum is σ = 77295769362. Its totient is φ = 77295769360.

The previous prime is 77295769357. The next prime is 77295769363. The reversal of 77295769361 is 16396759277.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 67384372225 + 9911397136 = 259585^2 + 99556^2 .

It is a cyclic number.

It is not a de Polignac number, because 77295769361 - 22 = 77295769357 is a prime.

It is a super-2 number, since 2×772957693612 (a number of 23 digits) contains 22 as substring.

Together with 77295769363, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

Almost surely, 277295769361 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 30005640, while the sum is 62.

The spelling of 77295769361 in words is "seventy-seven billion, two hundred ninety-five million, seven hundred sixty-nine thousand, three hundred sixty-one".