Base | Representation |
---|---|
bin | 10000010000110… |
… | …00000110000001 |
3 | 100111200112020102 |
4 | 20020120012001 |
5 | 234410213234 |
6 | 21311452145 |
7 | 3244332125 |
oct | 1010300601 |
9 | 314615212 |
10 | 136413569 |
11 | 70002596 |
12 | 39827055 |
13 | 22352ab6 |
14 | 1418d585 |
15 | be98c7e |
hex | 8218181 |
136413569 has 2 divisors, whose sum is σ = 136413570. Its totient is φ = 136413568.
The previous prime is 136413539. The next prime is 136413577. The reversal of 136413569 is 965314631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 134838544 + 1575025 = 11612^2 + 1255^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-136413569 is a prime.
It is a super-2 number, since 2×1364135692 = 37217323614635522, which contains 22 as substring.
It is equal to p7720796 and since 136413569 and 7720796 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (136413539) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68206784 + 68206785.
It is an arithmetic number, because the mean of its divisors is an integer number (68206785).
Almost surely, 2136413569 is an apocalyptic number.
It is an amenable number.
136413569 is a deficient number, since it is larger than the sum of its proper divisors (1).
136413569 is an equidigital number, since it uses as much as digits as its factorization.
136413569 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 58320, while the sum is 38.
The square root of 136413569 is about 11679.6219544984. The cubic root of 136413569 is about 514.7770662965. Note that the first 3 decimals are identical.
The spelling of 136413569 in words is "one hundred thirty-six million, four hundred thirteen thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •