Base | Representation |
---|---|
bin | 10000010000110… |
… | …01101110100101 |
3 | 100111200212102021 |
4 | 20020121232211 |
5 | 234410422021 |
6 | 21311543141 |
7 | 3244360465 |
oct | 1010315645 |
9 | 314625367 |
10 | 136420261 |
11 | 7000761a |
12 | 3982aab1 |
13 | 22355b63 |
14 | 14191ba5 |
15 | be9ac41 |
hex | 8219ba5 |
136420261 has 4 divisors (see below), whose sum is σ = 136811500. Its totient is φ = 136029024.
The previous prime is 136420259. The next prime is 136420279. The reversal of 136420261 is 162024631.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 95062500 + 41357761 = 9750^2 + 6431^2 .
It is a cyclic number.
It is not a de Polignac number, because 136420261 - 21 = 136420259 is a prime.
It is a super-2 number, since 2×1364202612 = 37220975222616242, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136420201) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 195096 + ... + 195793.
It is an arithmetic number, because the mean of its divisors is an integer number (34202875).
Almost surely, 2136420261 is an apocalyptic number.
It is an amenable number.
136420261 is a deficient number, since it is larger than the sum of its proper divisors (391239).
136420261 is an equidigital number, since it uses as much as digits as its factorization.
136420261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 391238.
The product of its (nonzero) digits is 1728, while the sum is 25.
The square root of 136420261 is about 11679.9084328603. The cubic root of 136420261 is about 514.7854839141.
Adding to 136420261 its reverse (162024631), we get a palindrome (298444892).
The spelling of 136420261 in words is "one hundred thirty-six million, four hundred twenty thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •