The number 14262
14262 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 2377. Divisors (8): 1, 2, 3, 6, 2377, 4754, 7131, 14262.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14262 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14262 is composite. Its prime factorisation is
- 3
The divisors add up to 28536; without 14262 itself that is 14274, so 14262 is abundant (14274 is more than 14262). Euler's totient φ(14262) = 4752 numbers up to 14262 share no factor with it.
- 4
The digits of 14262 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 195 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14262 = 2 \times 3 \times 2377 \]
14262 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 28536 |
| Euler totient φ(n) | 4752 |
| Square | 203404644 |
| Cube | 2900957032728 |
| Square root | 119.423616 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 195 |
| Scientific notation | 1.4262 × |
14262 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand two hundred and sixty-two |
| Binary (base 2) | 11011110110110 |
| Octal (base 8) | 33666 |
| Hexadecimal (base 16) | 37B6 |
| Base 3 | 201120020 |
| As time | 14262 seconds = 3 h 57 min 42 s |
Is 14262 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14262 ÷ 2 = 7131) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (14262 ÷ 3 = 4754) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 | Yes (14262 ÷ 6 = 2377) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14262 a prime number?
No. 14262 = 2 × 3 × 2377, so it is divisible by 2.
What are the factors of 14262?
1, 2, 3, 6, 2377, 4754, 7131, 14262.
What is 14262 in binary?
11011110110110 (hexadecimal 37B6, octal 33666).
What is the square root of 14262?
About 119.4236.
Is 14262 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 14262?
It is a composite number with 8 divisors.