The number 14013
14013 is a composite number with 10 divisors. Its prime factorisation is × 173. Divisors (10): 1, 3, 9, 27, 81, 173, 519, 1557, 4671, 14013.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14013: a Harshad number: divisible by its digit sum 9.
- 2
14013 is composite. Its prime factorisation is
- 3
The divisors add up to 21054; without 14013 itself that is 7041, so 14013 is deficient (7041 is less than 14013). Euler's totient φ(14013) = 9288 numbers up to 14013 share no factor with it.
- 4
The digits of 14013 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 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14013 = 3^{4} \times 173 \]14013 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 21054 |
| Euler totient φ(n) | 9288 |
| Square | 196364169 |
| Cube | 2751651100197 |
| Square root | 118.376518 (= 9√173) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.4013 × |
14013 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand and thirteen |
| Binary (base 2) | 11011010111101 |
| Octal (base 8) | 33275 |
| Hexadecimal (base 16) | 36BD |
| Base 3 | 201020000 |
| As time | 14013 seconds = 3 h 53 min 33 s |
Is 14013 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 (14013 ÷ 3 = 4671) | 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 3) | 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 6) | 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 | Yes (14013 ÷ 9 = 1557) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 14013 a prime number?
No. 14013 = × 173, so it is divisible by 3.
What are the factors of 14013?
1, 3, 9, 27, 81, 173, 519, 1557, 4671, 14013.
What is 14013 in binary?
11011010111101 (hexadecimal 36BD, octal 33275).
What is the square root of 14013?
About 118.3765, exactly 9√173.
Is 14013 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 14013?
14013 is a Harshad number: divisible by its digit sum 9.