The number 14681
14681 is a composite number with 4 divisors. Its prime factorisation is 53 × 277. Divisors (4): 1, 53, 277, 14681.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14681: a semiprime: 53 × 277, the product of two primes.
- 2
14681 is composite. Its prime factorisation is
- 3
The divisors add up to 15012; without 14681 itself that is 331, so 14681 is deficient (331 is less than 14681). Euler's totient φ(14681) = 14352 numbers up to 14681 share no factor with it.
- 4
The digits of 14681 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 195 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14681 = 53 \times 277 \]
14681 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15012 |
| Euler totient φ(n) | 14352 |
| Square | 215531761 |
| Cube | 3164221783241 |
| Square root | 121.165177 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 195 |
| Scientific notation | 1.4681 × |
14681 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand six hundred and eighty-one |
| Binary (base 2) | 11100101011001 |
| Octal (base 8) | 34531 |
| Hexadecimal (base 16) | 3959 |
| Base 3 | 202010202 |
| As time | 14681 seconds = 4 h 4 min 41 s |
Is 14681 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 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 2) | 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 7) | 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 14681 a prime number?
No. 14681 = 53 × 277, so it is divisible by 53.
What are the factors of 14681?
1, 53, 277, 14681.
What is 14681 in binary?
11100101011001 (hexadecimal 3959, octal 34531).
What is the square root of 14681?
About 121.1652.
Is 14681 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 14681?
14681 is a semiprime: 53 × 277, the product of two primes.