The number 42568
42568 is a composite number with 16 divisors. Its prime factorisation is × 17 × 313. Divisors (16): 1, 2, 4, 8, 17, 34, 68, 136, 313, 626, 1252, 2504, 5321, 10642, 21284, 42568.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
42568 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
42568 is composite. Its prime factorisation is
- 3
The divisors add up to 84780; without 42568 itself that is 42212, so 42568 is deficient (42212 is less than 42568). Euler's totient φ(42568) = 19968 numbers up to 42568 share no factor with it.
- 4
The digits of 42568 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 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 42568 = 2^{3} \times 17 \times 313 \]42568 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 84780 |
| Euler totient φ(n) | 19968 |
| Square | 1812034624 |
| Cube | 77134689874432 |
| Square root | 206.320140 (= 2√10642) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 57 |
| Scientific notation | 4.2568 × |
42568 in other forms
| Form | Value |
|---|---|
| In words | forty-two thousand five hundred and sixty-eight |
| Binary (base 2) | 1010011001001000 |
| Octal (base 8) | 123110 |
| Hexadecimal (base 16) | A648 |
| Base 3 | 2011101121 |
| As time | 42568 seconds = 11 h 49 min 28 s |
Is 42568 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (42568 ÷ 2 = 21284) | 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 | Yes (42568 ÷ 4 = 10642) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 1) | 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 | Yes (42568 ÷ 8 = 5321) | 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 8) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 42568 a prime number?
No. 42568 = × 17 × 313, so it is divisible by 2.
What are the factors of 42568?
1, 2, 4, 8, 17, 34, 68, 136, 313, 626, 1252, 2504, 5321, 10642, 21284, 42568.
What is 42568 in binary?
1010011001001000 (hexadecimal A648, octal 123110).
What is the square root of 42568?
About 206.3201, exactly 2√10642.
Is 42568 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 42568?
It is a composite number with 16 divisors.