The number 10642
10642 is a composite number with 8 divisors. Its prime factorisation is 2 × 17 × 313. Divisors (8): 1, 2, 17, 34, 313, 626, 5321, 10642.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10642 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10642 is composite. Its prime factorisation is
- 3
The divisors add up to 16956; without 10642 itself that is 6314, so 10642 is deficient (6314 is less than 10642). Euler's totient φ(10642) = 4992 numbers up to 10642 share no factor with it.
- 4
The digits of 10642 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10642 = 2 \times 17 \times 313 \]
10642 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 16956 |
| Euler totient φ(n) | 4992 |
| Square | 113252164 |
| Cube | 1205229529288 |
| Square root | 103.160070 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 55 |
| Scientific notation | 1.0642 × |
10642 in other forms
| Form | Value |
|---|---|
| In words | ten thousand six hundred and forty-two |
| Binary (base 2) | 10100110010010 |
| Octal (base 8) | 24622 |
| Hexadecimal (base 16) | 2992 |
| Base 3 | 112121011 |
| As time | 10642 seconds = 2 h 57 min 22 s |
Is 10642 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10642 ÷ 2 = 5321) | 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 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 4) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10642 a prime number?
No. 10642 = 2 × 17 × 313, so it is divisible by 2.
What are the factors of 10642?
1, 2, 17, 34, 313, 626, 5321, 10642.
What is 10642 in binary?
10100110010010 (hexadecimal 2992, octal 24622).
What is the square root of 10642?
About 103.1601.
Is 10642 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 10642?
It is a composite number with 8 divisors.