Search a number
-
+
136909631 is a prime number
BaseRepresentation
bin10000010100100…
…01001100111111
3100112121201201002
420022101030333
5240022102011
621330240515
73251466305
oct1012211477
9315551632
10136909631
1170311261
1239a2613b
1322497821
141427c275
15c045c3b
hex829133f

136909631 has 2 divisors, whose sum is σ = 136909632. Its totient is φ = 136909630.

The previous prime is 136909627. The next prime is 136909651.

136909631 is nontrivially palindromic in base 10.

It is a weak prime.

It is a palprime.

It is a cyclic number.

It is not a de Polignac number, because 136909631 - 22 = 136909627 is a prime.

It is a super-2 number, since 2×1369096312 = 37488494121112322, which contains 22 as substring.

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 2136909631 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 26244, while the sum is 38.

The square root of 136909631 is about 11700.8389015489. The cubic root of 136909631 is about 515.4002995764.

The spelling of 136909631 in words is "one hundred thirty-six million, nine hundred nine thousand, six hundred thirty-one".