The number 14642
14642 is a composite number with 4 divisors. Its prime factorisation is 2 × 7321. Divisors (4): 1, 2, 7321, 14642.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14642: a semiprime: 2 × 7321, the product of two primes.
- 2
14642 is composite. Its prime factorisation is
- 3
The divisors add up to 21966; without 14642 itself that is 7324, so 14642 is deficient (7324 is less than 14642). Euler's totient φ(14642) = 7320 numbers up to 14642 share no factor with it.
- 4
The digits of 14642 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14642 = 2 \times 7321 \]
14642 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 21966 |
| Euler totient φ(n) | 7320 |
| Square | 214388164 |
| Cube | 3139071497288 |
| Square root | 121.004132 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 45 |
| Scientific notation | 1.4642 × |
14642 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand six hundred and forty-two |
| Binary (base 2) | 11100100110010 |
| Octal (base 8) | 34462 |
| Hexadecimal (base 16) | 3932 |
| Base 3 | 202002022 |
| As time | 14642 seconds = 4 h 4 min 2 s |
Is 14642 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14642 ÷ 2 = 7321) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14642 a prime number?
No. 14642 = 2 × 7321, so it is divisible by 2.
What are the factors of 14642?
1, 2, 7321, 14642.
What is 14642 in binary?
11100100110010 (hexadecimal 3932, octal 34462).
What is the square root of 14642?
About 121.0041.
Is 14642 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 14642?
14642 is a semiprime: 2 × 7321, the product of two primes.