The number 14061
14061 is a composite number with 8 divisors. Its prime factorisation is 3 × 43 × 109. Divisors (8): 1, 3, 43, 109, 129, 327, 4687, 14061.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14061 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14061 is composite. Its prime factorisation is
- 3
The divisors add up to 19360; without 14061 itself that is 5299, so 14061 is deficient (5299 is less than 14061). Euler's totient φ(14061) = 9072 numbers up to 14061 share no factor with it.
- 4
The digits of 14061 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14061 = 3 \times 43 \times 109 \]
14061 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 19360 |
| Euler totient φ(n) | 9072 |
| Square | 197711721 |
| Cube | 2780024508981 |
| Square root | 118.579088 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 151 |
| Scientific notation | 1.4061 × |
14061 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand and sixty-one |
| Binary (base 2) | 11011011101101 |
| Octal (base 8) | 33355 |
| Hexadecimal (base 16) | 36ED |
| Base 3 | 201021210 |
| As time | 14061 seconds = 3 h 54 min 21 s |
Is 14061 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 (14061 ÷ 3 = 4687) | 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 5) | 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 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 3) | 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 14061 a prime number?
No. 14061 = 3 × 43 × 109, so it is divisible by 3.
What are the factors of 14061?
1, 3, 43, 109, 129, 327, 4687, 14061.
What is 14061 in binary?
11011011101101 (hexadecimal 36ED, octal 33355).
What is the square root of 14061?
About 118.5791.
Is 14061 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 14061?
It is a composite number with 8 divisors.