The number 14671
14671 is a composite number with 4 divisors. Its prime factorisation is 17 × 863. Divisors (4): 1, 17, 863, 14671.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14671: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 17 × 863, the product of two primes.
- 2
14671 is composite. Its prime factorisation is
- 3
The divisors add up to 15552; without 14671 itself that is 881, so 14671 is deficient (881 is less than 14671). Euler's totient φ(14671) = 13792 numbers up to 14671 share no factor with it.
- 4
The digits of 14671 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14671 = 17 \times 863 \]
14671 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15552 |
| Euler totient φ(n) | 13792 |
| Square | 215238241 |
| Cube | 3157760233711 |
| Square root | 121.123904 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 76 |
| Scientific notation | 1.4671 × |
14671 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand six hundred and seventy-one |
| Binary (base 2) | 11100101001111 |
| Octal (base 8) | 34517 |
| Hexadecimal (base 16) | 394F |
| Base 3 | 202010101 |
| As time | 14671 seconds = 4 h 4 min 31 s |
Is 14671 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 | No (remainder 1) | 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 6) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 14671 a prime number?
No. 14671 = 17 × 863, so it is divisible by 17.
What are the factors of 14671?
1, 17, 863, 14671.
What is 14671 in binary?
11100101001111 (hexadecimal 394F, octal 34517).
What is the square root of 14671?
About 121.1239.
Is 14671 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 14671?
14671 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 17 × 863, the product of two primes.