The number 14963
14963 is a composite number with 4 divisors. Its prime factorisation is 13 × 1151. Divisors (4): 1, 13, 1151, 14963.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14963: a semiprime: 13 × 1151, the product of two primes.
- 2
14963 is composite. Its prime factorisation is
- 3
The divisors add up to 16128; without 14963 itself that is 1165, so 14963 is deficient (1165 is less than 14963). Euler's totient φ(14963) = 13800 numbers up to 14963 share no factor with it.
- 4
The digits of 14963 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 164 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14963 = 13 \times 1151 \]
14963 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16128 |
| Euler totient φ(n) | 13800 |
| Square | 223891369 |
| Cube | 3350086554347 |
| Square root | 122.323342 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 164 |
| Scientific notation | 1.4963 × |
14963 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand nine hundred and sixty-three |
| Binary (base 2) | 11101001110011 |
| Octal (base 8) | 35163 |
| Hexadecimal (base 16) | 3A73 |
| Base 3 | 202112012 |
| As time | 14963 seconds = 4 h 9 min 23 s |
Is 14963 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 2) | 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 5) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14963 a prime number?
No. 14963 = 13 × 1151, so it is divisible by 13.
What are the factors of 14963?
1, 13, 1151, 14963.
What is 14963 in binary?
11101001110011 (hexadecimal 3A73, octal 35163).
What is the square root of 14963?
About 122.3233.
Is 14963 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 14963?
14963 is a semiprime: 13 × 1151, the product of two primes.