The number 14981
14981 is a composite number with 4 divisors. Its prime factorisation is 71 × 211. Divisors (4): 1, 71, 211, 14981.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14981: a semiprime: 71 × 211, the product of two primes.
- 2
14981 is composite. Its prime factorisation is
- 3
The divisors add up to 15264; without 14981 itself that is 283, so 14981 is deficient (283 is less than 14981). Euler's totient φ(14981) = 14700 numbers up to 14981 share no factor with it.
- 4
The digits of 14981 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
\[ 14981 = 71 \times 211 \]
14981 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15264 |
| Euler totient φ(n) | 14700 |
| Square | 224430361 |
| Cube | 3362191238141 |
| Square root | 122.396895 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 164 |
| Scientific notation | 1.4981 × |
14981 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand nine hundred and eighty-one |
| Binary (base 2) | 11101010000101 |
| Octal (base 8) | 35205 |
| Hexadecimal (base 16) | 3A85 |
| Base 3 | 202112212 |
| As time | 14981 seconds = 4 h 9 min 41 s |
Is 14981 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 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 5) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14981 a prime number?
No. 14981 = 71 × 211, so it is divisible by 71.
What are the factors of 14981?
1, 71, 211, 14981.
What is 14981 in binary?
11101010000101 (hexadecimal 3A85, octal 35205).
What is the square root of 14981?
About 122.3969.
Is 14981 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 14981?
14981 is a semiprime: 71 × 211, the product of two primes.