Base | Representation |
---|---|
bin | 10000010000101… |
… | …11010001101101 |
3 | 100111200100122102 |
4 | 20020113101231 |
5 | 234410111341 |
6 | 21311424445 |
7 | 3244316303 |
oct | 1010272155 |
9 | 314610572 |
10 | 136410221 |
11 | 70000022 |
12 | 39825125 |
13 | 2235140c |
14 | 1418c273 |
15 | be97c9b |
hex | 821746d |
136410221 has 2 divisors, whose sum is σ = 136410222. Its totient is φ = 136410220.
The previous prime is 136410179. The next prime is 136410223. The reversal of 136410221 is 122014631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 134884996 + 1525225 = 11614^2 + 1235^2 .
It is a cyclic number.
It is not a de Polignac number, because 136410221 - 210 = 136409197 is a prime.
Together with 136410223, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 136410193 and 136410202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136410223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68205110 + 68205111.
It is an arithmetic number, because the mean of its divisors is an integer number (68205111).
Almost surely, 2136410221 is an apocalyptic number.
It is an amenable number.
136410221 is a deficient number, since it is larger than the sum of its proper divisors (1).
136410221 is an equidigital number, since it uses as much as digits as its factorization.
136410221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 20.
The square root of 136410221 is about 11679.4786270621. The cubic root of 136410221 is about 514.7728548686.
Adding to 136410221 its reverse (122014631), we get a palindrome (258424852).
It can be divided in two parts, 136410 and 221, that added together give a palindrome (136631).
The spelling of 136410221 in words is "one hundred thirty-six million, four hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •