The number 69965
69965 is a composite number with 8 divisors. Its prime factorisation is 5 × 7 × 1999. Divisors (8): 1, 5, 7, 35, 1999, 9995, 13993, 69965.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69965: a Harshad number: divisible by its digit sum 35.
- 2
69965 is composite. Its prime factorisation is
- 3
The divisors add up to 96000; without 69965 itself that is 26035, so 69965 is deficient (26035 is less than 69965). Euler's totient φ(69965) = 47952 numbers up to 69965 share no factor with it.
- 4
The digits of 69965 add up to 35, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69965 = 5 \times 7 \times 1999 \]
69965 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 96000 |
| Euler totient φ(n) | 47952 |
| Square | 4895101225 |
| Cube | 342485757207125 |
| Square root | 264.508979 |
| Digit sum / digital root | 35 / 8 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.9965 × |
69965 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand nine hundred and sixty-five |
| Binary (base 2) | 10001000101001101 |
| Octal (base 8) | 210515 |
| Hexadecimal (base 16) | 1114D |
| Base 3 | 10112222022 |
| As time | 69965 seconds = 19 h 26 min 5 s |
Is 69965 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 | Yes (69965 ÷ 5 = 13993) | 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 | Yes (69965 ÷ 7 = 9995) | 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 5) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 69965 a prime number?
No. 69965 = 5 × 7 × 1999, so it is divisible by 5.
What are the factors of 69965?
1, 5, 7, 35, 1999, 9995, 13993, 69965.
What is 69965 in binary?
10001000101001101 (hexadecimal 1114D, octal 210515).
What is the square root of 69965?
About 264.5090.
Is 69965 divisible by 3?
No. Its digits add up to 35, which is not a multiple of 3.
What is special about the number 69965?
69965 is a Harshad number: divisible by its digit sum 35.