Search a number
-
+
136952213 is a prime number
BaseRepresentation
bin10000010100110…
…11100110010101
3100112200220010012
420022123212111
5240024432323
621331210005
73252034406
oct1012334625
9315626105
10136952213
1170340252
1239a46905
13224b1018
141428d9ad
15c053678
hex829b995

136952213 has 2 divisors, whose sum is σ = 136952214. Its totient is φ = 136952212.

The previous prime is 136952197. The next prime is 136952227. The reversal of 136952213 is 312259631.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 115068529 + 21883684 = 10727^2 + 4678^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 136952213 - 24 = 136952197 is a prime.

It is a Sophie Germain prime.

It is a Chen prime.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 136952213.

It is a congruent number.

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

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

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

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

Almost surely, 2136952213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 9720, while the sum is 32.

The square root of 136952213 is about 11702.6583732073. The cubic root of 136952213 is about 515.4537277647.

The spelling of 136952213 in words is "one hundred thirty-six million, nine hundred fifty-two thousand, two hundred thirteen".