Search a number
-
+
136566550031 is a prime number
BaseRepresentation
bin111111100110000000…
…0000010111000001111
3111001111120001112211112
41333030000002320033
54214142014100111
6142423211042235
712603150344042
oct1771400027017
9431446045745
10136566550031
1152a1029138a
1222573a4037b
13cb55456ab2
146877634c59
1538445ace8b
hex1fcc002e0f

136566550031 has 2 divisors, whose sum is σ = 136566550032. Its totient is φ = 136566550030.

The previous prime is 136566549971. The next prime is 136566550033. The reversal of 136566550031 is 130055665631.

It is a happy number.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 136566550031 - 26 = 136566549967 is a prime.

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

Together with 136566550033, 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 (136566550033) by changing a digit.

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

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

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

Almost surely, 2136566550031 is an apocalyptic number.

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

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

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

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

The spelling of 136566550031 in words is "one hundred thirty-six billion, five hundred sixty-six million, five hundred fifty thousand, thirty-one".