Search a number
-
+
136914733 is a prime number
BaseRepresentation
bin10000010100100…
…10011100101101
3100112121222201001
420022102130231
5240022232413
621330320301
73251520214
oct1012223455
9315558631
10136914733
117031507a
1239a29091
1322499c47
141428007b
15c0474dd
hex829272d

136914733 has 2 divisors, whose sum is σ = 136914734. Its totient is φ = 136914732.

The previous prime is 136914697. The next prime is 136914797. The reversal of 136914733 is 337419631.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 110103049 + 26811684 = 10493^2 + 5178^2 .

It is a cyclic number.

It is not a de Polignac number, because 136914733 - 213 = 136906541 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 2136914733 is an apocalyptic number.

It is an amenable number.

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

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

136914733 is an evil number, because the sum of its binary digits is even.

The product of its digits is 40824, while the sum is 37.

The square root of 136914733 is about 11701.0569180737. The cubic root of 136914733 is about 515.4067017061.

The spelling of 136914733 in words is "one hundred thirty-six million, nine hundred fourteen thousand, seven hundred thirty-three".