Base | Representation |
---|---|
bin | 10000010001011… |
… | …11101001101101 |
3 | 100111212102121012 |
4 | 20020233221231 |
5 | 234421310221 |
6 | 21313515005 |
7 | 3245213342 |
oct | 1010575155 |
9 | 314772535 |
10 | 136510061 |
11 | 70069036 |
12 | 39872a65 |
13 | 223879ac |
14 | 141b67c9 |
15 | beb765b |
hex | 822fa6d |
136510061 has 2 divisors, whose sum is σ = 136510062. Its totient is φ = 136510060.
The previous prime is 136510001. The next prime is 136510063. The reversal of 136510061 is 160015631.
It is a happy number.
136510061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 120868036 + 15642025 = 10994^2 + 3955^2 .
It is a cyclic number.
It is not a de Polignac number, because 136510061 - 214 = 136493677 is a prime.
Together with 136510063, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136510063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68255030 + 68255031.
It is an arithmetic number, because the mean of its divisors is an integer number (68255031).
Almost surely, 2136510061 is an apocalyptic number.
It is an amenable number.
136510061 is a deficient number, since it is larger than the sum of its proper divisors (1).
136510061 is an equidigital number, since it uses as much as digits as its factorization.
136510061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 540, while the sum is 23.
The square root of 136510061 is about 11683.7520086657. The cubic root of 136510061 is about 514.8984133684.
Adding to 136510061 its reverse (160015631), we get a palindrome (296525692).
The spelling of 136510061 in words is "one hundred thirty-six million, five hundred ten thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •