Search a number
-
+
136909469 is a prime number
BaseRepresentation
bin10000010100100…
…01001010011101
3100112121201111002
420022101022131
5240022100334
621330240045
73251465654
oct1012211235
9315551432
10136909469
1170311124
1239a26025
1322497728
141427c19b
15c045b7e
hex829129d

136909469 has 2 divisors, whose sum is σ = 136909470. Its totient is φ = 136909468.

The previous prime is 136909411. The next prime is 136909499. The reversal of 136909469 is 964909631.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 104305369 + 32604100 = 10213^2 + 5710^2 .

It is a cyclic number.

It is not a de Polignac number, because 136909469 - 224 = 120132253 is a prime.

It is a super-2 number, since 2×1369094692 = 37488405403723922, 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 (136909499) by changing a digit.

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

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

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

Almost surely, 2136909469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 314928, while the sum is 47.

The square root of 136909469 is about 11700.8319789663. The cubic root of 136909469 is about 515.4000962917.

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