The number 69967
69967 is a composite number with 8 divisors. Its prime factorisation is 31 × 37 × 61. Divisors (8): 1, 31, 37, 61, 1147, 1891, 2257, 69967.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69967: a Harshad number: divisible by its digit sum 37.
- 2
69967 is composite. Its prime factorisation is
- 3
The divisors add up to 75392; without 69967 itself that is 5425, so 69967 is deficient (5425 is less than 69967). Euler's totient φ(69967) = 64800 numbers up to 69967 share no factor with it.
- 4
The digits of 69967 add up to 37, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 205 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69967 = 31 \times 37 \times 61 \]
69967 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 75392 |
| Euler totient φ(n) | 64800 |
| Square | 4895381089 |
| Cube | 342515128654063 |
| Square root | 264.512760 |
| Digit sum / digital root | 37 / 1 |
| Collatz steps to 1 | 205 |
| Scientific notation | 6.9967 × |
69967 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand nine hundred and sixty-seven |
| Binary (base 2) | 10001000101001111 |
| Octal (base 8) | 210517 |
| Hexadecimal (base 16) | 1114F |
| Base 3 | 10112222101 |
| As time | 69967 seconds = 19 h 26 min 7 s |
Is 69967 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 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69967 a prime number?
No. 69967 = 31 × 37 × 61, so it is divisible by 31.
What are the factors of 69967?
1, 31, 37, 61, 1147, 1891, 2257, 69967.
What is 69967 in binary?
10001000101001111 (hexadecimal 1114F, octal 210517).
What is the square root of 69967?
About 264.5128.
Is 69967 divisible by 3?
No. Its digits add up to 37, which is not a multiple of 3.
What is special about the number 69967?
69967 is a Harshad number: divisible by its digit sum 37.