The number 59014
59014 is a composite number with 8 divisors. Its prime factorisation is 2 × 19 × 1553. Divisors (8): 1, 2, 19, 38, 1553, 3106, 29507, 59014.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59014: a Harshad number: divisible by its digit sum 19.
- 2
59014 is composite. Its prime factorisation is
- 3
The divisors add up to 93240; without 59014 itself that is 34226, so 59014 is deficient (34226 is less than 59014). Euler's totient φ(59014) = 27936 numbers up to 59014 share no factor with it.
- 4
The digits of 59014 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 166 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59014 = 2 \times 19 \times 1553 \]
59014 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 93240 |
| Euler totient φ(n) | 27936 |
| Square | 3482652196 |
| Cube | 205525236694744 |
| Square root | 242.927973 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 166 |
| Scientific notation | 5.9014 × |
59014 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand and fourteen |
| Binary (base 2) | 1110011010000110 |
| Octal (base 8) | 163206 |
| Hexadecimal (base 16) | E686 |
| Base 3 | 2222221201 |
| As time | 59014 seconds = 16 h 23 min 34 s |
Is 59014 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59014 ÷ 2 = 29507) | 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 2) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 6) | 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 4) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59014 a prime number?
No. 59014 = 2 × 19 × 1553, so it is divisible by 2.
What are the factors of 59014?
1, 2, 19, 38, 1553, 3106, 29507, 59014.
What is 59014 in binary?
1110011010000110 (hexadecimal E686, octal 163206).
What is the square root of 59014?
About 242.9280.
Is 59014 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 59014?
59014 is a Harshad number: divisible by its digit sum 19.