The number 695
695 is a composite number with 4 divisors. Its prime factorisation is 5 × 139. Divisors (4): 1, 5, 139, 695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 695: a semiprime: 5 × 139, the product of two primes.
- 2
695 is composite. Its prime factorisation is
- 3
The divisors add up to 840; without 695 itself that is 145, so 695 is deficient (145 is less than 695). Euler's totient φ(695) = 552 numbers up to 695 share no factor with it.
- 4
The digits of 695 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 126 steps to reach 1.
LaTeX source of the formulas on this page
\[ 695 = 5 \times 139 \]
695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 840 |
| Euler totient φ(n) | 552 |
| Square | 483025 |
| Cube | 335702375 |
| Square root | 26.362853 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 126 |
| Scientific notation | 6.95 × |
695 in other forms
| Form | Value |
|---|---|
| In words | six hundred and ninety-five |
| Roman numerals | DCXCV |
| Binary (base 2) | 1010110111 |
| Octal (base 8) | 1267 |
| Hexadecimal (base 16) | 2B7 |
| Base 3 | 221202 |
| As time | 695 seconds = 11 min 35 s |
Is 695 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (695 ÷ 5 = 139) | 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 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 2) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 695 a prime number?
No. 695 = 5 × 139, so it is divisible by 5.
What are the factors of 695?
1, 5, 139, 695.
What is 695 in binary?
1010110111 (hexadecimal 2B7, octal 1267).
What is the square root of 695?
About 26.3629.
What is 695 in Roman numerals?
DCXCV.
Is 695 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 695?
695 is a semiprime: 5 × 139, the product of two primes.