Base | Representation |
---|---|
bin | 10000011010001… |
… | …11101011111111 |
3 | 100121000201000122 |
4 | 20031013223333 |
5 | 240220011322 |
6 | 21354245155 |
7 | 3261031421 |
oct | 1015075377 |
9 | 317021018 |
10 | 137657087 |
11 | 70781897 |
12 | 3a1267bb |
13 | 22699ac9 |
14 | 143d4811 |
15 | c142442 |
hex | 8347aff |
137657087 has 4 divisors (see below), whose sum is σ = 138097200. Its totient is φ = 137216976.
The previous prime is 137657063. The next prime is 137657111. The reversal of 137657087 is 780756731.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 780756731 = 31 ⋅25185701.
It is an interprime number because it is at equal distance from previous prime (137657063) and next prime (137657111).
It is a cyclic number.
It is not a de Polignac number, because 137657087 - 210 = 137656063 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (137657017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 219587 + ... + 220212.
It is an arithmetic number, because the mean of its divisors is an integer number (34524300).
Almost surely, 2137657087 is an apocalyptic number.
137657087 is a deficient number, since it is larger than the sum of its proper divisors (440113).
137657087 is an equidigital number, since it uses as much as digits as its factorization.
137657087 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 440112.
The product of its (nonzero) digits is 246960, while the sum is 44.
The square root of 137657087 is about 11732.7356997420. The cubic root of 137657087 is about 516.3365378169.
The spelling of 137657087 in words is "one hundred thirty-seven million, six hundred fifty-seven thousand, eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •