Base | Representation |
---|---|
bin | 10000010010010… |
… | …00100100101101 |
3 | 100112001121121221 |
4 | 20021020210231 |
5 | 234433042031 |
6 | 21320023341 |
7 | 3246120061 |
oct | 1011104455 |
9 | 315047557 |
10 | 136612141 |
11 | 701287a6 |
12 | 39901b51 |
13 | 223c22b3 |
14 | 14201aa1 |
15 | bed7a11 |
hex | 824892d |
136612141 has 4 divisors (see below), whose sum is σ = 137821212. Its totient is φ = 135403072.
The previous prime is 136612121. The next prime is 136612159. The reversal of 136612141 is 141216631.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 141216631 = 29 ⋅4869539.
It can be written as a sum of positive squares in 2 ways, for example, as 73170916 + 63441225 = 8554^2 + 7965^2 .
It is a cyclic number.
It is not a de Polignac number, because 136612141 - 27 = 136612013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136612121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 604366 + ... + 604591.
It is an arithmetic number, because the mean of its divisors is an integer number (34455303).
Almost surely, 2136612141 is an apocalyptic number.
It is an amenable number.
136612141 is a deficient number, since it is larger than the sum of its proper divisors (1209071).
136612141 is a wasteful number, since it uses less digits than its factorization.
136612141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1209070.
The product of its digits is 864, while the sum is 25.
The square root of 136612141 is about 11688.1196520227. The cubic root of 136612141 is about 515.0267256059.
Adding to 136612141 its reverse (141216631), we get a palindrome (277828772).
The spelling of 136612141 in words is "one hundred thirty-six million, six hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •