Search a number
-
+
136113748562171 is a prime number
BaseRepresentation
bin11110111100101101110011…
…101000011101000011111011
3122211221100101011112111122002
4132330231303220131003323
5120320041424112442141
61201253443131251215
740445615402066042
oct3674556350350373
9584840334474562
10136113748562171
113a408575648a56
121332390aba9b0b
135ac46189095b3
142587d24d53559
1510b096e783e9b
hex7bcb73a1d0fb

136113748562171 has 2 divisors, whose sum is σ = 136113748562172. Its totient is φ = 136113748562170.

The previous prime is 136113748562117. The next prime is 136113748562219. The reversal of 136113748562171 is 171265847311631.

It is a happy number.

Together with previous prime (136113748562117) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 136113748562171 - 226 = 136113681453307 is a prime.

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

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

Almost surely, 2136113748562171 is an apocalyptic number.

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

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

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

The product of its digits is 5080320, while the sum is 56.

The spelling of 136113748562171 in words is "one hundred thirty-six trillion, one hundred thirteen billion, seven hundred forty-eight million, five hundred sixty-two thousand, one hundred seventy-one".