Search a number
-
+
136051537 is a prime number
BaseRepresentation
bin10000001101111…
…11101101010001
3100111000010121211
420012333231101
5234312122122
621300020121
73241263466
oct1006775521
9314003554
10136051537
116a885596
1239691641
132225708b
14140d766d
15be26877
hex81bfb51

136051537 has 2 divisors, whose sum is σ = 136051538. Its totient is φ = 136051536.

The previous prime is 136051501. The next prime is 136051547. The reversal of 136051537 is 735150631.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 134003776 + 2047761 = 11576^2 + 1431^2 .

It is a cyclic number.

It is not a de Polignac number, because 136051537 - 211 = 136049489 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 136051499 and 136051508.

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

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

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

Almost surely, 2136051537 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9450, while the sum is 31.

The square root of 136051537 is about 11664.1132110418. The cubic root of 136051537 is about 514.3212688198.

The spelling of 136051537 in words is "one hundred thirty-six million, fifty-one thousand, five hundred thirty-seven".