The number 14263
14263 is a composite number with 4 divisors. Its prime factorisation is 17 × 839. Divisors (4): 1, 17, 839, 14263.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14263: a semiprime: 17 × 839, the product of two primes.
- 2
14263 is composite. Its prime factorisation is
- 3
The divisors add up to 15120; without 14263 itself that is 857, so 14263 is deficient (857 is less than 14263). Euler's totient φ(14263) = 13408 numbers up to 14263 share no factor with it.
- 4
The digits of 14263 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 195 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14263 = 17 \times 839 \]
14263 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15120 |
| Euler totient φ(n) | 13408 |
| Square | 203433169 |
| Cube | 2901567289447 |
| Square root | 119.427802 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 195 |
| Scientific notation | 1.4263 × |
14263 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand two hundred and sixty-three |
| Binary (base 2) | 11011110110111 |
| Octal (base 8) | 33667 |
| Hexadecimal (base 16) | 37B7 |
| Base 3 | 201120021 |
| As time | 14263 seconds = 3 h 57 min 43 s |
Is 14263 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 | No (remainder 3) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 7) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14263 a prime number?
No. 14263 = 17 × 839, so it is divisible by 17.
What are the factors of 14263?
1, 17, 839, 14263.
What is 14263 in binary?
11011110110111 (hexadecimal 37B7, octal 33667).
What is the square root of 14263?
About 119.4278.
Is 14263 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 14263?
14263 is a semiprime: 17 × 839, the product of two primes.