Base | Representation |
---|---|
bin | 10000001101111… |
… | …11001001001111 |
3 | 100111000000110102 |
4 | 20012333021033 |
5 | 234312033411 |
6 | 21300001315 |
7 | 3241253663 |
oct | 1006771117 |
9 | 314000412 |
10 | 136049231 |
11 | 6a88388a |
12 | 3969023b |
13 | 22256006 |
14 | 140d68a3 |
15 | be25d3b |
hex | 81bf24f |
136049231 has 2 divisors, whose sum is σ = 136049232. Its totient is φ = 136049230.
The previous prime is 136049203. The next prime is 136049233. The reversal of 136049231 is 132940631.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 136049231 - 26 = 136049167 is a prime.
It is a super-2 number, since 2×1360492312 = 37018786511382722, which contains 22 as substring.
Together with 136049233, 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 = 136049194 and 136049203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136049233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68024615 + 68024616.
It is an arithmetic number, because the mean of its divisors is an integer number (68024616).
Almost surely, 2136049231 is an apocalyptic number.
136049231 is a deficient number, since it is larger than the sum of its proper divisors (1).
136049231 is an equidigital number, since it uses as much as digits as its factorization.
136049231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 29.
The square root of 136049231 is about 11664.0143604164. The cubic root of 136049231 is about 514.3183629809.
Adding to 136049231 its reverse (132940631), we get a palindrome (268989862).
The spelling of 136049231 in words is "one hundred thirty-six million, forty-nine thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •