The number 14031
14031 is a composite number with 6 divisors. Its prime factorisation is × 1559. Divisors (6): 1, 3, 9, 1559, 4677, 14031.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14031: a Harshad number: divisible by its digit sum 9.
- 2
14031 is composite. Its prime factorisation is
- 3
The divisors add up to 20280; without 14031 itself that is 6249, so 14031 is deficient (6249 is less than 14031). Euler's totient φ(14031) = 9348 numbers up to 14031 share no factor with it.
- 4
The digits of 14031 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 182 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14031 = 3^{2} \times 1559 \]14031 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 20280 |
| Euler totient φ(n) | 9348 |
| Square | 196868961 |
| Cube | 2762268391791 |
| Square root | 118.452522 (= 3√1559) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 182 |
| Scientific notation | 1.4031 × |
14031 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand and thirty-one |
| Binary (base 2) | 11011011001111 |
| Octal (base 8) | 33317 |
| Hexadecimal (base 16) | 36CF |
| Base 3 | 201020200 |
| As time | 14031 seconds = 3 h 53 min 51 s |
Is 14031 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 (14031 ÷ 3 = 4677) | 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 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (14031 ÷ 9 = 1559) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14031 a prime number?
No. 14031 = × 1559, so it is divisible by 3.
What are the factors of 14031?
1, 3, 9, 1559, 4677, 14031.
What is 14031 in binary?
11011011001111 (hexadecimal 36CF, octal 33317).
What is the square root of 14031?
About 118.4525, exactly 3√1559.
Is 14031 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 14031?
14031 is a Harshad number: divisible by its digit sum 9.