The number 14861
14861 is a composite number with 8 divisors. Its prime factorisation is 7 × 11 × 193. Divisors (8): 1, 7, 11, 77, 193, 1351, 2123, 14861.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14861 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14861 is composite. Its prime factorisation is
- 3
The divisors add up to 18624; without 14861 itself that is 3763, so 14861 is deficient (3763 is less than 14861). Euler's totient φ(14861) = 11520 numbers up to 14861 share no factor with it.
- 4
The digits of 14861 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 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14861 = 7 \times 11 \times 193 \]
14861 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 18624 |
| Euler totient φ(n) | 11520 |
| Square | 220849321 |
| Cube | 3282041759381 |
| Square root | 121.905701 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 40 |
| Scientific notation | 1.4861 × |
14861 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand eight hundred and sixty-one |
| Binary (base 2) | 11101000001101 |
| Octal (base 8) | 35015 |
| Hexadecimal (base 16) | 3A0D |
| Base 3 | 202101102 |
| As time | 14861 seconds = 4 h 7 min 41 s |
Is 14861 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 | Yes (14861 ÷ 7 = 2123) | 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 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 | Yes (14861 ÷ 11 = 1351) | 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 14861 a prime number?
No. 14861 = 7 × 11 × 193, so it is divisible by 7.
What are the factors of 14861?
1, 7, 11, 77, 193, 1351, 2123, 14861.
What is 14861 in binary?
11101000001101 (hexadecimal 3A0D, octal 35015).
What is the square root of 14861?
About 121.9057.
Is 14861 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 14861?
It is a composite number with 8 divisors.