The number 705
705 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 47. Divisors (8): 1, 3, 5, 15, 47, 141, 235, 705.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
705 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
705 is composite. Its prime factorisation is
- 3
The divisors add up to 1152; without 705 itself that is 447, so 705 is deficient (447 is less than 705). Euler's totient φ(705) = 368 numbers up to 705 share no factor with it.
- 4
The digits of 705 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 33 steps to reach 1.
LaTeX source of the formulas on this page
\[ 705 = 3 \times 5 \times 47 \]
705 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 1152 |
| Euler totient φ(n) | 368 |
| Square | 497025 |
| Cube | 350402625 |
| Square root | 26.551836 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 33 |
| Scientific notation | 7.05 × |
705 in other forms
| Form | Value |
|---|---|
| In words | seven hundred and five |
| Roman numerals | DCCV |
| Binary (base 2) | 1011000001 |
| Octal (base 8) | 1301 |
| Hexadecimal (base 16) | 2C1 |
| Base 3 | 222010 |
| As time | 705 seconds = 11 min 45 s |
Is 705 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 | Yes (705 ÷ 3 = 235) | 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 (705 ÷ 5 = 141) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 3) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 705 a prime number?
No. 705 = 3 × 5 × 47, so it is divisible by 3.
What are the factors of 705?
1, 3, 5, 15, 47, 141, 235, 705.
What is 705 in binary?
1011000001 (hexadecimal 2C1, octal 1301).
What is the square root of 705?
About 26.5518.
What is 705 in Roman numerals?
DCCV.
Is 705 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 705?
It is a composite number with 8 divisors.