The number 14381
14381 is a composite number with 4 divisors. Its prime factorisation is 73 × 197. Divisors (4): 1, 73, 197, 14381.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14381: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 73 × 197, the product of two primes.
- 2
14381 is composite. Its prime factorisation is
- 3
The divisors add up to 14652; without 14381 itself that is 271, so 14381 is deficient (271 is less than 14381). Euler's totient φ(14381) = 14112 numbers up to 14381 share no factor with it.
- 4
The digits of 14381 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14381 = 73 \times 197 \]
14381 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 14652 |
| Euler totient φ(n) | 14112 |
| Square | 206813161 |
| Cube | 2974180068341 |
| Square root | 119.920807 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.4381 × |
14381 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand three hundred and eighty-one |
| Binary (base 2) | 11100000101101 |
| Octal (base 8) | 34055 |
| Hexadecimal (base 16) | 382D |
| Base 3 | 201201122 |
| As time | 14381 seconds = 3 h 59 min 41 s |
Is 14381 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 3) | 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 8) | 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 4) | 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 14381 a prime number?
No. 14381 = 73 × 197, so it is divisible by 73.
What are the factors of 14381?
1, 73, 197, 14381.
What is 14381 in binary?
11100000101101 (hexadecimal 382D, octal 34055).
What is the square root of 14381?
About 119.9208.
Is 14381 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 14381?
14381 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 73 × 197, the product of two primes.