The number 59002
59002 is a composite number with 4 divisors. Its prime factorisation is 2 × 29501. Divisors (4): 1, 2, 29501, 59002.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59002: a semiprime: 2 × 29501, the product of two primes.
- 2
59002 is composite. Its prime factorisation is
- 3
The divisors add up to 88506; without 59002 itself that is 29504, so 59002 is deficient (29504 is less than 59002). Euler's totient φ(59002) = 29500 numbers up to 59002 share no factor with it.
- 4
The digits of 59002 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59002 = 2 \times 29501 \]
59002 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 88506 |
| Euler totient φ(n) | 29500 |
| Square | 3481236004 |
| Cube | 205399886708008 |
| Square root | 242.903273 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 47 |
| Scientific notation | 5.9002 × |
59002 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand and two |
| Binary (base 2) | 1110011001111010 |
| Octal (base 8) | 163172 |
| Hexadecimal (base 16) | E67A |
| Base 3 | 2222221021 |
| As time | 59002 seconds = 16 h 23 min 22 s |
Is 59002 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59002 ÷ 2 = 29501) | 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 2) | 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 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59002 a prime number?
No. 59002 = 2 × 29501, so it is divisible by 2.
What are the factors of 59002?
1, 2, 29501, 59002.
What is 59002 in binary?
1110011001111010 (hexadecimal E67A, octal 163172).
What is the square root of 59002?
About 242.9033.
Is 59002 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 59002?
59002 is a semiprime: 2 × 29501, the product of two primes.