The number 14492
14492 is a composite number with 6 divisors. Its prime factorisation is × 3623. Divisors (6): 1, 2, 4, 3623, 7246, 14492.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14492 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14492 is composite. Its prime factorisation is
- 3
The divisors add up to 25368; without 14492 itself that is 10876, so 14492 is deficient (10876 is less than 14492). Euler's totient φ(14492) = 7244 numbers up to 14492 share no factor with it.
- 4
The digits of 14492 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 120 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14492 = 2^{2} \times 3623 \]14492 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 25368 |
| Euler totient φ(n) | 7244 |
| Square | 210018064 |
| Cube | 3043581783488 |
| Square root | 120.382723 (= 2√3623) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 120 |
| Scientific notation | 1.4492 × |
14492 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand four hundred and ninety-two |
| Binary (base 2) | 11100010011100 |
| Octal (base 8) | 34234 |
| Hexadecimal (base 16) | 389C |
| Base 3 | 201212202 |
| As time | 14492 seconds = 4 h 1 min 32 s |
Is 14492 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14492 ÷ 2 = 7246) | 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 (14492 ÷ 4 = 3623) | 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 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 4) | 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 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14492 a prime number?
No. 14492 = × 3623, so it is divisible by 2.
What are the factors of 14492?
1, 2, 4, 3623, 7246, 14492.
What is 14492 in binary?
11100010011100 (hexadecimal 389C, octal 34234).
What is the square root of 14492?
About 120.3827, exactly 2√3623.
Is 14492 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 14492?
It is a composite number with 6 divisors.