Base | Representation |
---|---|
bin | 10000011010001… |
… | …11100110100101 |
3 | 100121000200112211 |
4 | 20031013212211 |
5 | 240220003431 |
6 | 21354243421 |
7 | 3261030415 |
oct | 1015074645 |
9 | 317020484 |
10 | 137656741 |
11 | 70781602 |
12 | 3a126571 |
13 | 226998c1 |
14 | 143d4645 |
15 | c1422b1 |
hex | 83479a5 |
137656741 has 4 divisors (see below), whose sum is σ = 140254092. Its totient is φ = 135059392.
The previous prime is 137656669. The next prime is 137656747. The reversal of 137656741 is 147656731.
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 63266116 + 74390625 = 7954^2 + 8625^2 .
It is a cyclic number.
It is not a de Polignac number, because 137656741 - 223 = 129268133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 137656694 and 137656703.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (137656747) 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, 1298596 + ... + 1298701.
It is an arithmetic number, because the mean of its divisors is an integer number (35063523).
Almost surely, 2137656741 is an apocalyptic number.
It is an amenable number.
137656741 is a deficient number, since it is larger than the sum of its proper divisors (2597351).
137656741 is an equidigital number, since it uses as much as digits as its factorization.
137656741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2597350.
The product of its digits is 105840, while the sum is 40.
The square root of 137656741 is about 11732.7209546635. The cubic root of 137656741 is about 516.3361052140.
The spelling of 137656741 in words is "one hundred thirty-seven million, six hundred fifty-six thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •