The number 14361
14361 is a composite number with 4 divisors. Its prime factorisation is 3 × 4787. Divisors (4): 1, 3, 4787, 14361.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14361: a semiprime: 3 × 4787, the product of two primes.
- 2
14361 is composite. Its prime factorisation is
- 3
The divisors add up to 19152; without 14361 itself that is 4791, so 14361 is deficient (4791 is less than 14361). Euler's totient φ(14361) = 9572 numbers up to 14361 share no factor with it.
- 4
The digits of 14361 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14361 = 3 \times 4787 \]
14361 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 19152 |
| Euler totient φ(n) | 9572 |
| Square | 206238321 |
| Cube | 2961788527881 |
| Square root | 119.837390 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 151 |
| Scientific notation | 1.4361 × |
14361 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand three hundred and sixty-one |
| Binary (base 2) | 11100000011001 |
| Octal (base 8) | 34031 |
| Hexadecimal (base 16) | 3819 |
| Base 3 | 201200220 |
| As time | 14361 seconds = 3 h 59 min 21 s |
Is 14361 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 (14361 ÷ 3 = 4787) | 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 4) | 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 6) | 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 6) | 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 14361 a prime number?
No. 14361 = 3 × 4787, so it is divisible by 3.
What are the factors of 14361?
1, 3, 4787, 14361.
What is 14361 in binary?
11100000011001 (hexadecimal 3819, octal 34031).
What is the square root of 14361?
About 119.8374.
Is 14361 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 14361?
14361 is a semiprime: 3 × 4787, the product of two primes.