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