The number 14695
14695 is a composite number with 4 divisors. Its prime factorisation is 5 × 2939. Divisors (4): 1, 5, 2939, 14695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14695: a semiprime: 5 × 2939, the product of two primes.
- 2
14695 is composite. Its prime factorisation is
- 3
The divisors add up to 17640; without 14695 itself that is 2945, so 14695 is deficient (2945 is less than 14695). Euler's totient φ(14695) = 11752 numbers up to 14695 share no factor with it.
- 4
The digits of 14695 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 270 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14695 = 5 \times 2939 \]
14695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 17640 |
| Euler totient φ(n) | 11752 |
| Square | 215943025 |
| Cube | 3173282752375 |
| Square root | 121.222935 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 270 |
| Scientific notation | 1.4695 × |
14695 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand six hundred and ninety-five |
| Binary (base 2) | 11100101100111 |
| Octal (base 8) | 34547 |
| Hexadecimal (base 16) | 3967 |
| Base 3 | 202011021 |
| As time | 14695 seconds = 4 h 4 min 55 s |
Is 14695 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 | Yes (14695 ÷ 5 = 2939) | 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 7) | 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 10) | 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 14695 a prime number?
No. 14695 = 5 × 2939, so it is divisible by 5.
What are the factors of 14695?
1, 5, 2939, 14695.
What is 14695 in binary?
11100101100111 (hexadecimal 3967, octal 34547).
What is the square root of 14695?
About 121.2229.
Is 14695 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 14695?
14695 is a semiprime: 5 × 2939, the product of two primes.