The number 14961
14961 is a composite number with 4 divisors. Its prime factorisation is 3 × 4987. Divisors (4): 1, 3, 4987, 14961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14961: a semiprime: 3 × 4987, the product of two primes.
- 2
14961 is composite. Its prime factorisation is
- 3
The divisors add up to 19952; without 14961 itself that is 4991, so 14961 is deficient (4991 is less than 14961). Euler's totient φ(14961) = 9972 numbers up to 14961 share no factor with it.
- 4
The digits of 14961 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 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14961 = 3 \times 4987 \]
14961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 19952 |
| Euler totient φ(n) | 9972 |
| Square | 223831521 |
| Cube | 3348743385681 |
| Square root | 122.315167 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.4961 × |
14961 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand nine hundred and sixty-one |
| Binary (base 2) | 11101001110001 |
| Octal (base 8) | 35161 |
| Hexadecimal (base 16) | 3A71 |
| Base 3 | 202112010 |
| As time | 14961 seconds = 4 h 9 min 21 s |
Is 14961 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 (14961 ÷ 3 = 4987) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 | 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 1) | 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 1) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14961 a prime number?
No. 14961 = 3 × 4987, so it is divisible by 3.
What are the factors of 14961?
1, 3, 4987, 14961.
What is 14961 in binary?
11101001110001 (hexadecimal 3A71, octal 35161).
What is the square root of 14961?
About 122.3152.
Is 14961 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 14961?
14961 is a semiprime: 3 × 4987, the product of two primes.