The number 14059
14059 is a composite number with 4 divisors. Its prime factorisation is 17 × 827. Divisors (4): 1, 17, 827, 14059.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14059: a semiprime: 17 × 827, the product of two primes.
- 2
14059 is composite. Its prime factorisation is
- 3
The divisors add up to 14904; without 14059 itself that is 845, so 14059 is deficient (845 is less than 14059). Euler's totient φ(14059) = 13216 numbers up to 14059 share no factor with it.
- 4
The digits of 14059 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14059 = 17 \times 827 \]
14059 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 14904 |
| Euler totient φ(n) | 13216 |
| Square | 197655481 |
| Cube | 2778838407379 |
| Square root | 118.570654 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 45 |
| Scientific notation | 1.4059 × |
14059 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand and fifty-nine |
| Binary (base 2) | 11011011101011 |
| Octal (base 8) | 33353 |
| Hexadecimal (base 16) | 36EB |
| Base 3 | 201021201 |
| As time | 14059 seconds = 3 h 54 min 19 s |
Is 14059 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 1) | 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 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14059 a prime number?
No. 14059 = 17 × 827, so it is divisible by 17.
What are the factors of 14059?
1, 17, 827, 14059.
What is 14059 in binary?
11011011101011 (hexadecimal 36EB, octal 33353).
What is the square root of 14059?
About 118.5707.
Is 14059 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 14059?
14059 is a semiprime: 17 × 827, the product of two primes.