Base | Representation |
---|---|
bin | 10000001111011… |
… | …10010110010101 |
3 | 100111100211200112 |
4 | 20013232112111 |
5 | 234334230311 |
6 | 21304052405 |
7 | 3243020456 |
oct | 1007562625 |
9 | 314324615 |
10 | 136242581 |
11 | 6a9a6082 |
12 | 39764105 |
13 | 222c3017 |
14 | 1414712d |
15 | be6328b |
hex | 81ee595 |
136242581 has 2 divisors, whose sum is σ = 136242582. Its totient is φ = 136242580.
The previous prime is 136242571. The next prime is 136242649. The reversal of 136242581 is 185242631.
136242581 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 117180625 + 19061956 = 10825^2 + 4366^2 .
It is a cyclic number.
It is not a de Polignac number, because 136242581 - 210 = 136241557 is a prime.
It is a super-2 number, since 2×1362425812 = 37124081755083122, which contains 22 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 (136242571) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68121290 + 68121291.
It is an arithmetic number, because the mean of its divisors is an integer number (68121291).
Almost surely, 2136242581 is an apocalyptic number.
It is an amenable number.
136242581 is a deficient number, since it is larger than the sum of its proper divisors (1).
136242581 is an equidigital number, since it uses as much as digits as its factorization.
136242581 is an evil number, because the sum of its binary digits is even.
The product of its digits is 11520, while the sum is 32.
The square root of 136242581 is about 11672.2997305587. The cubic root of 136242581 is about 514.5618934123.
Subtracting 136242581 from its reverse (185242631), we obtain a triangular number (49000050 = T9899).
The spelling of 136242581 in words is "one hundred thirty-six million, two hundred forty-two thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •