Base | Representation |
---|---|
bin | 10000010100001… |
… | …11111001011001 |
3 | 100112112210102022 |
4 | 20022013321121 |
5 | 240014342023 |
6 | 21325344225 |
7 | 3251250212 |
oct | 1012077131 |
9 | 315483368 |
10 | 136871513 |
11 | 70295659 |
12 | 39a08075 |
13 | 2248337c |
14 | 1426c409 |
15 | c0397c8 |
hex | 8287e59 |
136871513 has 2 divisors, whose sum is σ = 136871514. Its totient is φ = 136871512.
The previous prime is 136871509. The next prime is 136871521. The reversal of 136871513 is 315178631.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 131974144 + 4897369 = 11488^2 + 2213^2 .
It is a cyclic number.
It is not a de Polignac number, because 136871513 - 22 = 136871509 is a prime.
It is a super-2 number, since 2×1368715132 = 37467622141818338, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (136871533) 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, 68435756 + 68435757.
It is an arithmetic number, because the mean of its divisors is an integer number (68435757).
Almost surely, 2136871513 is an apocalyptic number.
It is an amenable number.
136871513 is a deficient number, since it is larger than the sum of its proper divisors (1).
136871513 is an equidigital number, since it uses as much as digits as its factorization.
136871513 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 15120, while the sum is 35.
The square root of 136871513 is about 11699.2099305893. The cubic root of 136871513 is about 515.3524630290.
The spelling of 136871513 in words is "one hundred thirty-six million, eight hundred seventy-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •