Base | Representation |
---|---|
bin | 10000010011010… |
… | …10001111010101 |
3 | 100112022121210012 |
4 | 20021222033111 |
5 | 240002000122 |
6 | 21323010005 |
7 | 3250233104 |
oct | 1011521725 |
9 | 315277705 |
10 | 136750037 |
11 | 70212366 |
12 | 39969905 |
13 | 2243cca8 |
14 | 1423a03b |
15 | c0137e2 |
hex | 826a3d5 |
136750037 has 2 divisors, whose sum is σ = 136750038. Its totient is φ = 136750036.
The previous prime is 136749997. The next prime is 136750043. The reversal of 136750037 is 730057631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 136095556 + 654481 = 11666^2 + 809^2 .
It is a cyclic number.
It is not a de Polignac number, because 136750037 - 216 = 136684501 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 136749985 and 136750012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136750337) 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 as a sum of consecutive naturals, namely, 68375018 + 68375019.
It is an arithmetic number, because the mean of its divisors is an integer number (68375019).
Almost surely, 2136750037 is an apocalyptic number.
It is an amenable number.
136750037 is a deficient number, since it is larger than the sum of its proper divisors (1).
136750037 is an equidigital number, since it uses as much as digits as its factorization.
136750037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13230, while the sum is 32.
The square root of 136750037 is about 11694.0171455322. The cubic root of 136750037 is about 515.1999562874.
The spelling of 136750037 in words is "one hundred thirty-six million, seven hundred fifty thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •