The number 10492
10492 is a composite number with 12 divisors. Its prime factorisation is × 43 × 61. Divisors (12): 1, 2, 4, 43, 61, 86, 122, 172, 244, 2623, 5246, 10492.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10492 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10492 is composite. Its prime factorisation is
- 3
The divisors add up to 19096; without 10492 itself that is 8604, so 10492 is deficient (8604 is less than 10492). Euler's totient φ(10492) = 5040 numbers up to 10492 share no factor with it.
- 4
The digits of 10492 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 104 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10492 = 2^{2} \times 43 \times 61 \]10492 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 19096 |
| Euler totient φ(n) | 5040 |
| Square | 110082064 |
| Cube | 1154981015488 |
| Square root | 102.430464 (= 2√2623) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 104 |
| Scientific notation | 1.0492 × |
10492 in other forms
| Form | Value |
|---|---|
| In words | ten thousand four hundred and ninety-two |
| Binary (base 2) | 10100011111100 |
| Octal (base 8) | 24374 |
| Hexadecimal (base 16) | 28FC |
| Base 3 | 112101121 |
| As time | 10492 seconds = 2 h 54 min 52 s |
Is 10492 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10492 ÷ 2 = 5246) | 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 (10492 ÷ 4 = 2623) | 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 6) | 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 4) | 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 2) | 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 10492 a prime number?
No. 10492 = × 43 × 61, so it is divisible by 2.
What are the factors of 10492?
1, 2, 4, 43, 61, 86, 122, 172, 244, 2623, 5246, 10492.
What is 10492 in binary?
10100011111100 (hexadecimal 28FC, octal 24374).
What is the square root of 10492?
About 102.4305, exactly 2√2623.
Is 10492 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 10492?
It is a composite number with 12 divisors.