Base | Representation |
---|---|
bin | 10000010100001… |
… | …10100110101001 |
3 | 100112112112011011 |
4 | 20022012212221 |
5 | 240014204332 |
6 | 21325303521 |
7 | 3251225605 |
oct | 1012064651 |
9 | 315475134 |
10 | 136866217 |
11 | 70291684 |
12 | 39a04ba1 |
13 | 22480b37 |
14 | 1426a505 |
15 | c037e47 |
hex | 82869a9 |
136866217 has 2 divisors, whose sum is σ = 136866218. Its totient is φ = 136866216.
The previous prime is 136866187. The next prime is 136866239. The reversal of 136866217 is 712668631.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 131125401 + 5740816 = 11451^2 + 2396^2 .
It is a cyclic number.
It is not a de Polignac number, because 136866217 - 27 = 136866089 is a prime.
It is a super-2 number, since 2×1368662172 = 37464722711782178, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 136866217.
It is not a weakly prime, because it can be changed into another prime (136866517) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68433108 + 68433109.
It is an arithmetic number, because the mean of its divisors is an integer number (68433109).
Almost surely, 2136866217 is an apocalyptic number.
It is an amenable number.
136866217 is a deficient number, since it is larger than the sum of its proper divisors (1).
136866217 is an equidigital number, since it uses as much as digits as its factorization.
136866217 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 72576, while the sum is 40.
The square root of 136866217 is about 11698.9835883294. The cubic root of 136866217 is about 515.3458160606.
The spelling of 136866217 in words is "one hundred thirty-six million, eight hundred sixty-six thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •