Search a number
-
+
76720136261 is a prime number
BaseRepresentation
bin100011101110011100…
…0000110000001000101
321100000202110201210012
41013130320012001011
52224110323330021
655124510440005
75354124253436
oct1073470060105
9240022421705
1076720136261
112a59a57599a
1212a51503005
137308782c42
1439db32148d
151ee059735b
hex11dce06045

76720136261 has 2 divisors, whose sum is σ = 76720136262. Its totient is φ = 76720136260.

The previous prime is 76720136203. The next prime is 76720136263. The reversal of 76720136261 is 16263102767.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 73628109025 + 3092027236 = 271345^2 + 55606^2 .

It is an emirp because it is prime and its reverse (16263102767) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 76720136261 - 26 = 76720136197 is a prime.

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

It is a Chen prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (76720136263) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 38360068130 + 38360068131.

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

Almost surely, 276720136261 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 127008, while the sum is 41.

The spelling of 76720136261 in words is "seventy-six billion, seven hundred twenty million, one hundred thirty-six thousand, two hundred sixty-one".