The number 59068
59068 is a composite number with 6 divisors. Its prime factorisation is × 14767. Divisors (6): 1, 2, 4, 14767, 29534, 59068.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59068 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59068 is composite. Its prime factorisation is
- 3
The divisors add up to 103376; without 59068 itself that is 44308, so 59068 is deficient (44308 is less than 59068). Euler's totient φ(59068) = 29532 numbers up to 59068 share no factor with it.
- 4
The digits of 59068 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 197 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59068 = 2^{2} \times 14767 \]59068 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 103376 |
| Euler totient φ(n) | 29532 |
| Square | 3489028624 |
| Cube | 206089942762432 |
| Square root | 243.039092 (= 2√14767) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 197 |
| Scientific notation | 5.9068 × |
59068 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand and sixty-eight |
| Binary (base 2) | 1110011010111100 |
| Octal (base 8) | 163274 |
| Hexadecimal (base 16) | E6BC |
| Base 3 | 10000000201 |
| As time | 59068 seconds = 16 h 24 min 28 s |
Is 59068 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59068 ÷ 2 = 29534) | 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 | Yes (59068 ÷ 4 = 14767) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 4) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59068 a prime number?
No. 59068 = × 14767, so it is divisible by 2.
What are the factors of 59068?
1, 2, 4, 14767, 29534, 59068.
What is 59068 in binary?
1110011010111100 (hexadecimal E6BC, octal 163274).
What is the square root of 59068?
About 243.0391, exactly 2√14767.
Is 59068 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 59068?
It is a composite number with 6 divisors.