The number 4695
4695 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 313. Divisors (8): 1, 3, 5, 15, 313, 939, 1565, 4695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
4695 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
4695 is composite. Its prime factorisation is
- 3
The divisors add up to 7536; without 4695 itself that is 2841, so 4695 is deficient (2841 is less than 4695). Euler's totient φ(4695) = 2496 numbers up to 4695 share no factor with it.
- 4
The digits of 4695 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 108 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4695 = 3 \times 5 \times 313 \]
4695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 7536 |
| Euler totient φ(n) | 2496 |
| Square | 22043025 |
| Cube | 103492002375 |
| Square root | 68.520070 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 108 |
| Scientific notation | 4.695 × |
4695 in other forms
| Form | Value |
|---|---|
| In words | four thousand six hundred and ninety-five |
| Binary (base 2) | 1001001010111 |
| Octal (base 8) | 11127 |
| Hexadecimal (base 16) | 1257 |
| Base 3 | 20102220 |
| As time | 4695 seconds = 1 h 18 min 15 s |
Is 4695 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 (4695 ÷ 3 = 1565) | 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 (4695 ÷ 5 = 939) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 4695 a prime number?
No. 4695 = 3 × 5 × 313, so it is divisible by 3.
What are the factors of 4695?
1, 3, 5, 15, 313, 939, 1565, 4695.
What is 4695 in binary?
1001001010111 (hexadecimal 1257, octal 11127).
What is the square root of 4695?
About 68.5201.
Is 4695 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 4695?
It is a composite number with 8 divisors.