Search a number
-
+
136680436779967 is a prime number
BaseRepresentation
bin11111000100111101100100…
…111000011100101110111111
3122220221112002122101200122001
4133010331210320130232333
5120403333013303424332
61202410043102403131
740534556432341363
oct3704754470345677
9586845078350561
10136680436779967
113a606936346533
12133b57018904a7
135b35baa025872
1425a7522dc72a3
1510c0589d990e7
hex7c4f64e1cbbf

136680436779967 has 2 divisors, whose sum is σ = 136680436779968. Its totient is φ = 136680436779966.

The previous prime is 136680436779961. The next prime is 136680436780049. The reversal of 136680436779967 is 769977634086631.

It is an a-pointer prime, because the next prime (136680436780049) can be obtained adding 136680436779967 to its sum of digits (82).

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 136680436779967 - 27 = 136680436779839 is a prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (29) of ones.

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

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

Almost surely, 2136680436779967 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 10369949184, while the sum is 82.

The spelling of 136680436779967 in words is "one hundred thirty-six trillion, six hundred eighty billion, four hundred thirty-six million, seven hundred seventy-nine thousand, nine hundred sixty-seven".