The number 14351
14351 is a composite number with 4 divisors. Its prime factorisation is 113 × 127. Divisors (4): 1, 113, 127, 14351.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14351: a semiprime: 113 × 127, the product of two primes.
- 2
14351 is composite. Its prime factorisation is
- 3
The divisors add up to 14592; without 14351 itself that is 241, so 14351 is deficient (241 is less than 14351). Euler's totient φ(14351) = 14112 numbers up to 14351 share no factor with it.
- 4
The digits of 14351 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14351 = 113 \times 127 \]
14351 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 14592 |
| Euler totient φ(n) | 14112 |
| Square | 205951201 |
| Cube | 2955605685551 |
| Square root | 119.795659 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 76 |
| Scientific notation | 1.4351 × |
14351 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand three hundred and fifty-one |
| Binary (base 2) | 11100000001111 |
| Octal (base 8) | 34017 |
| Hexadecimal (base 16) | 380F |
| Base 3 | 201200112 |
| As time | 14351 seconds = 3 h 59 min 11 s |
Is 14351 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 3) | 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 1) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14351 a prime number?
No. 14351 = 113 × 127, so it is divisible by 113.
What are the factors of 14351?
1, 113, 127, 14351.
What is 14351 in binary?
11100000001111 (hexadecimal 380F, octal 34017).
What is the square root of 14351?
About 119.7957.
Is 14351 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 14351?
14351 is a semiprime: 113 × 127, the product of two primes.