The number 14763
14763 is a composite number with 16 divisors. Its prime factorisation is 3 × 7 × 19 × 37. Divisors (16): 1, 3, 7, 19, 21, 37, 57, 111, 133, 259, 399, 703, 777, 2109, 4921, 14763.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14763: a Harshad number: divisible by its digit sum 21.
- 2
14763 is composite. Its prime factorisation is
- 3
The divisors add up to 24320; without 14763 itself that is 9557, so 14763 is deficient (9557 is less than 14763). Euler's totient φ(14763) = 7776 numbers up to 14763 share no factor with it.
- 4
The digits of 14763 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14763 = 3 \times 7 \times 19 \times 37 \]
14763 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 24320 |
| Euler totient φ(n) | 7776 |
| Square | 217946169 |
| Cube | 3217539292947 |
| Square root | 121.503086 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.4763 × |
14763 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand seven hundred and sixty-three |
| Binary (base 2) | 11100110101011 |
| Octal (base 8) | 34653 |
| Hexadecimal (base 16) | 39AB |
| Base 3 | 202020210 |
| As time | 14763 seconds = 4 h 6 min 3 s |
Is 14763 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 | Yes (14763 ÷ 3 = 4921) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (14763 ÷ 7 = 2109) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14763 a prime number?
No. 14763 = 3 × 7 × 19 × 37, so it is divisible by 3.
What are the factors of 14763?
1, 3, 7, 19, 21, 37, 57, 111, 133, 259, 399, 703, 777, 2109, 4921, 14763.
What is 14763 in binary?
11100110101011 (hexadecimal 39AB, octal 34653).
What is the square root of 14763?
About 121.5031.
Is 14763 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 14763?
14763 is a Harshad number: divisible by its digit sum 21.