The number 42968
42968 is a composite number with 16 divisors. Its prime factorisation is × 41 × 131. Divisors (16): 1, 2, 4, 8, 41, 82, 131, 164, 262, 328, 524, 1048, 5371, 10742, 21484, 42968.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
42968 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
42968 is composite. Its prime factorisation is
- 3
The divisors add up to 83160; without 42968 itself that is 40192, so 42968 is deficient (40192 is less than 42968). Euler's totient φ(42968) = 20800 numbers up to 42968 share no factor with it.
- 4
The digits of 42968 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 132 steps to reach 1.
LaTeX source of the formulas on this page
\[ 42968 = 2^{3} \times 41 \times 131 \]42968 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 83160 |
| Euler totient φ(n) | 20800 |
| Square | 1846249024 |
| Cube | 79329628063232 |
| Square root | 207.287240 (= 2√10742) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 132 |
| Scientific notation | 4.2968 × |
42968 in other forms
| Form | Value |
|---|---|
| In words | forty-two thousand nine hundred and sixty-eight |
| Binary (base 2) | 1010011111011000 |
| Octal (base 8) | 123730 |
| Hexadecimal (base 16) | A7D8 |
| Base 3 | 2011221102 |
| As time | 42968 seconds = 11 h 56 min 8 s |
Is 42968 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (42968 ÷ 2 = 21484) | 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 | Yes (42968 ÷ 4 = 10742) | 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 2) | 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 | Yes (42968 ÷ 8 = 5371) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 42968 a prime number?
No. 42968 = × 41 × 131, so it is divisible by 2.
What are the factors of 42968?
1, 2, 4, 8, 41, 82, 131, 164, 262, 328, 524, 1048, 5371, 10742, 21484, 42968.
What is 42968 in binary?
1010011111011000 (hexadecimal A7D8, octal 123730).
What is the square root of 42968?
About 207.2872, exactly 2√10742.
Is 42968 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 42968?
It is a composite number with 16 divisors.