Base | Representation |
---|---|
bin | 10000010010000… |
… | …11001100111001 |
3 | 100112000111102222 |
4 | 20021003030321 |
5 | 234431341022 |
6 | 21315333425 |
7 | 3245665655 |
oct | 1011031471 |
9 | 315014388 |
10 | 136590137 |
11 | 70113212 |
12 | 398b1275 |
13 | 223b5288 |
14 | 141d7a65 |
15 | bed1242 |
hex | 8243339 |
136590137 has 4 divisors (see below), whose sum is σ = 136615296. Its totient is φ = 136564980.
The previous prime is 136590127. The next prime is 136590143. The reversal of 136590137 is 731095631.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 136590137 - 214 = 136573753 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 136590097 and 136590106.
It is not an unprimeable number, because it can be changed into a prime (136590127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 689 + ... + 16542.
It is an arithmetic number, because the mean of its divisors is an integer number (34153824).
Almost surely, 2136590137 is an apocalyptic number.
It is an amenable number.
136590137 is a deficient number, since it is larger than the sum of its proper divisors (25159).
136590137 is an equidigital number, since it uses as much as digits as its factorization.
136590137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25158.
The product of its (nonzero) digits is 17010, while the sum is 35.
The square root of 136590137 is about 11687.1783164286. The cubic root of 136590137 is about 514.9990724840. Note that the first 3 decimals are identical.
The spelling of 136590137 in words is "one hundred thirty-six million, five hundred ninety thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •