Base | Representation |
---|---|
bin | 10000001111111… |
… | …00101011111101 |
3 | 100111110211020122 |
4 | 20013330223331 |
5 | 234343120214 |
6 | 21305224325 |
7 | 3243353624 |
oct | 1007745375 |
9 | 314424218 |
10 | 136301309 |
11 | 6aa36211 |
12 | 397920a5 |
13 | 22313981 |
14 | 141606bb |
15 | be7588e |
hex | 81fcafd |
136301309 has 2 divisors, whose sum is σ = 136301310. Its totient is φ = 136301308.
The previous prime is 136301299. The next prime is 136301311. The reversal of 136301309 is 903103631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 122722084 + 13579225 = 11078^2 + 3685^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-136301309 is a prime.
It is a super-2 number, since 2×1363013092 = 37156093670226962, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 136301311, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136301329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68150654 + 68150655.
It is an arithmetic number, because the mean of its divisors is an integer number (68150655).
Almost surely, 2136301309 is an apocalyptic number.
It is an amenable number.
136301309 is a deficient number, since it is larger than the sum of its proper divisors (1).
136301309 is an equidigital number, since it uses as much as digits as its factorization.
136301309 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 26.
The square root of 136301309 is about 11674.8151591364. The cubic root of 136301309 is about 514.6358175596.
The spelling of 136301309 in words is "one hundred thirty-six million, three hundred one thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •