Base | Representation |
---|---|
bin | 10000010011001… |
… | …11110011010001 |
3 | 100112022010002021 |
4 | 20021213303101 |
5 | 240001140144 |
6 | 21322451441 |
7 | 3250162015 |
oct | 1011476321 |
9 | 315263067 |
10 | 136740049 |
11 | 70205906 |
12 | 39963b81 |
13 | 22438594 |
14 | 14236545 |
15 | c010884 |
hex | 8267cd1 |
136740049 has 4 divisors (see below), whose sum is σ = 140435764. Its totient is φ = 133044336.
The previous prime is 136740041. The next prime is 136740091. The reversal of 136740049 is 940047631.
It is a happy number.
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 82083600 + 54656449 = 9060^2 + 7393^2 .
It is a cyclic number.
It is not a de Polignac number, because 136740049 - 23 = 136740041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 136739996 and 136740023.
It is not an unprimeable number, because it can be changed into a prime (136740041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1847802 + ... + 1847875.
It is an arithmetic number, because the mean of its divisors is an integer number (35108941).
Almost surely, 2136740049 is an apocalyptic number.
It is an amenable number.
136740049 is a deficient number, since it is larger than the sum of its proper divisors (3695715).
136740049 is an equidigital number, since it uses as much as digits as its factorization.
136740049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3695714.
The product of its (nonzero) digits is 18144, while the sum is 34.
The square root of 136740049 is about 11693.5900817499. The cubic root of 136740049 is about 515.1874128601.
The spelling of 136740049 in words is "one hundred thirty-six million, seven hundred forty thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •