The number 59007
59007 is a composite number with 16 divisors. Its prime factorisation is 3 × 13 × 17 × 89. Divisors (16): 1, 3, 13, 17, 39, 51, 89, 221, 267, 663, 1157, 1513, 3471, 4539, 19669, 59007.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59007 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59007 is composite. Its prime factorisation is
- 3
The divisors add up to 90720; without 59007 itself that is 31713, so 59007 is deficient (31713 is less than 59007). Euler's totient φ(59007) = 33792 numbers up to 59007 share no factor with it.
- 4
The digits of 59007 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 272 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59007 = 3 \times 13 \times 17 \times 89 \]
59007 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 90720 |
| Euler totient φ(n) | 33792 |
| Square | 3481826049 |
| Cube | 205452109673343 |
| Square root | 242.913565 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 272 |
| Scientific notation | 5.9007 × |
59007 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand and seven |
| Binary (base 2) | 1110011001111111 |
| Octal (base 8) | 163177 |
| Hexadecimal (base 16) | E67F |
| Base 3 | 2222221110 |
| As time | 59007 seconds = 16 h 23 min 27 s |
Is 59007 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 (59007 ÷ 3 = 19669) | 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 2) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 59007 a prime number?
No. 59007 = 3 × 13 × 17 × 89, so it is divisible by 3.
What are the factors of 59007?
1, 3, 13, 17, 39, 51, 89, 221, 267, 663, 1157, 1513, 3471, 4539, 19669, 59007.
What is 59007 in binary?
1110011001111111 (hexadecimal E67F, octal 163177).
What is the square root of 59007?
About 242.9136.
Is 59007 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 59007?
It is a composite number with 16 divisors.