Search a number
-
+
136590497 is a prime number
BaseRepresentation
bin10000010010000…
…11010010100001
3100112000111221022
420021003102201
5234431343442
621315335225
73246000011
oct1011032241
9315014838
10136590497
117011350a
12398b1515
13223b54a4
14141d7c41
15bed13d2
hex82434a1

136590497 has 2 divisors, whose sum is σ = 136590498. Its totient is φ = 136590496.

The previous prime is 136590479. The next prime is 136590511. The reversal of 136590497 is 794095631.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 114725521 + 21864976 = 10711^2 + 4676^2 .

It is a cyclic number.

It is not a de Polignac number, because 136590497 - 28 = 136590241 is a prime.

It is a Chen prime.

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

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

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

Almost surely, 2136590497 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 204120, while the sum is 44.

The square root of 136590497 is about 11687.1937179119. The cubic root of 136590497 is about 514.9995249312. Note that the first 3 decimals are identical.

The spelling of 136590497 in words is "one hundred thirty-six million, five hundred ninety thousand, four hundred ninety-seven".