The number 69137
69137 is a composite number with 4 divisors. Its prime factorisation is 47 × 1471. Divisors (4): 1, 47, 1471, 69137.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69137: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 47 × 1471, the product of two primes.
- 2
69137 is composite. Its prime factorisation is
- 3
The divisors add up to 70656; without 69137 itself that is 1519, so 69137 is deficient (1519 is less than 69137). Euler's totient φ(69137) = 67620 numbers up to 69137 share no factor with it.
- 4
The digits of 69137 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 174 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69137 = 47 \times 1471 \]
69137 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 70656 |
| Euler totient φ(n) | 67620 |
| Square | 4779924769 |
| Cube | 330469658754353 |
| Square root | 262.939156 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 174 |
| Scientific notation | 6.9137 × |
69137 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand one hundred and thirty-seven |
| Binary (base 2) | 10000111000010001 |
| Octal (base 8) | 207021 |
| Hexadecimal (base 16) | 10E11 |
| Base 3 | 10111211122 |
| As time | 69137 seconds = 19 h 12 min 17 s |
Is 69137 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | A number is divisible by 7 if double the last digit and subtract it from the rest: the result is a multiple of 7. |
| 8 | No (remainder 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69137 a prime number?
No. 69137 = 47 × 1471, so it is divisible by 47.
What are the factors of 69137?
1, 47, 1471, 69137.
What is 69137 in binary?
10000111000010001 (hexadecimal 10E11, octal 207021).
What is the square root of 69137?
About 262.9392.
Is 69137 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 69137?
69137 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 47 × 1471, the product of two primes.