Base | Representation |
---|---|
bin | 10000010011001… |
… | …11101100011001 |
3 | 100112022002110222 |
4 | 20021213230121 |
5 | 240001131414 |
6 | 21322445425 |
7 | 3250160516 |
oct | 1011475431 |
9 | 315262428 |
10 | 136739609 |
11 | 70205546 |
12 | 39963875 |
13 | 22438316 |
14 | 1423630d |
15 | c01068e |
hex | 8267b19 |
136739609 has 2 divisors, whose sum is σ = 136739610. Its totient is φ = 136739608.
The previous prime is 136739597. The next prime is 136739627. The reversal of 136739609 is 906937631.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 71453209 + 65286400 = 8453^2 + 8080^2 .
It is an emirp because it is prime and its reverse (906937631) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 136739609 - 220 = 135691033 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 136739609.
It is not a weakly prime, because it can be changed into another prime (136739909) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68369804 + 68369805.
It is an arithmetic number, because the mean of its divisors is an integer number (68369805).
Almost surely, 2136739609 is an apocalyptic number.
It is an amenable number.
136739609 is a deficient number, since it is larger than the sum of its proper divisors (1).
136739609 is an equidigital number, since it uses as much as digits as its factorization.
136739609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 183708, while the sum is 44.
The square root of 136739609 is about 11693.5712680088. The cubic root of 136739609 is about 515.1868602722.
The spelling of 136739609 in words is "one hundred thirty-six million, seven hundred thirty-nine thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •