The number 53002
53002 is a composite number with 4 divisors. Its prime factorisation is 2 × 26501. Divisors (4): 1, 2, 26501, 53002.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53002: a semiprime: 2 × 26501, the product of two primes.
- 2
53002 is composite. Its prime factorisation is
- 3
The divisors add up to 79506; without 53002 itself that is 26504, so 53002 is deficient (26504 is less than 53002). Euler's totient φ(53002) = 26500 numbers up to 53002 share no factor with it.
- 4
The digits of 53002 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53002 = 2 \times 26501 \]
53002 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 79506 |
| Euler totient φ(n) | 26500 |
| Square | 2809212004 |
| Cube | 148893854636008 |
| Square root | 230.221632 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.3002 × |
53002 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand and two |
| Binary (base 2) | 1100111100001010 |
| Octal (base 8) | 147412 |
| Hexadecimal (base 16) | CF0A |
| Base 3 | 2200201001 |
| As time | 53002 seconds = 14 h 43 min 22 s |
Is 53002 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53002 ÷ 2 = 26501) | 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 5) | 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 1) | 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 4) | 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 53002 a prime number?
No. 53002 = 2 × 26501, so it is divisible by 2.
What are the factors of 53002?
1, 2, 26501, 53002.
What is 53002 in binary?
1100111100001010 (hexadecimal CF0A, octal 147412).
What is the square root of 53002?
About 230.2216.
Is 53002 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 53002?
53002 is a semiprime: 2 × 26501, the product of two primes.