Base | Representation |
---|---|
bin | 10000010011110… |
… | …01110010001101 |
3 | 100112102212010102 |
4 | 20021321302031 |
5 | 240011014314 |
6 | 21324220445 |
7 | 3250616534 |
oct | 1011716215 |
9 | 315385112 |
10 | 136813709 |
11 | 7025618a |
12 | 3999a725 |
13 | 22462c76 |
14 | 1425531b |
15 | c0275de |
hex | 8279c8d |
136813709 has 2 divisors, whose sum is σ = 136813710. Its totient is φ = 136813708.
The previous prime is 136813687. The next prime is 136813751. The reversal of 136813709 is 907318631.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 136656100 + 157609 = 11690^2 + 397^2 .
It is an emirp because it is prime and its reverse (907318631) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-136813709 is a prime.
It is a super-3 number, since 3×1368137093 (a number of 25 digits) contains 333 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136813759) 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, 68406854 + 68406855.
It is an arithmetic number, because the mean of its divisors is an integer number (68406855).
Almost surely, 2136813709 is an apocalyptic number.
It is an amenable number.
136813709 is a deficient number, since it is larger than the sum of its proper divisors (1).
136813709 is an equidigital number, since it uses as much as digits as its factorization.
136813709 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27216, while the sum is 38.
The square root of 136813709 is about 11696.7392464738. The cubic root of 136813709 is about 515.2799043991.
The spelling of 136813709 in words is "one hundred thirty-six million, eight hundred thirteen thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •