The number 42992
42992 is a composite number with 10 divisors. Its prime factorisation is × 2687. Divisors (10): 1, 2, 4, 8, 16, 2687, 5374, 10748, 21496, 42992.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
42992 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
42992 is composite. Its prime factorisation is
- 3
The divisors add up to 83328; without 42992 itself that is 40336, so 42992 is deficient (40336 is less than 42992). Euler's totient φ(42992) = 21488 numbers up to 42992 share no factor with it.
- 4
The digits of 42992 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 101 steps to reach 1.
LaTeX source of the formulas on this page
\[ 42992 = 2^{4} \times 2687 \]42992 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 83328 |
| Euler totient φ(n) | 21488 |
| Square | 1848312064 |
| Cube | 79462632255488 |
| Square root | 207.345123 (= 4√2687) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 101 |
| Scientific notation | 4.2992 × |
42992 in other forms
| Form | Value |
|---|---|
| In words | forty-two thousand nine hundred and ninety-two |
| Binary (base 2) | 1010011111110000 |
| Octal (base 8) | 123760 |
| Hexadecimal (base 16) | A7F0 |
| Base 3 | 2011222022 |
| As time | 42992 seconds = 11 h 56 min 32 s |
Is 42992 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (42992 ÷ 2 = 21496) | 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 (42992 ÷ 4 = 10748) | 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 | Yes (42992 ÷ 8 = 5374) | 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 4) | 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 42992 a prime number?
No. 42992 = × 2687, so it is divisible by 2.
What are the factors of 42992?
1, 2, 4, 8, 16, 2687, 5374, 10748, 21496, 42992.
What is 42992 in binary?
1010011111110000 (hexadecimal A7F0, octal 123760).
What is the square root of 42992?
About 207.3451, exactly 4√2687.
Is 42992 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 42992?
It is a composite number with 10 divisors.