The number 53008
53008 is a composite number with 10 divisors. Its prime factorisation is × 3313. Divisors (10): 1, 2, 4, 8, 16, 3313, 6626, 13252, 26504, 53008.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53008: a Harshad number: divisible by its digit sum 16.
- 2
53008 is composite. Its prime factorisation is
- 3
The divisors add up to 102734; without 53008 itself that is 49726, so 53008 is deficient (49726 is less than 53008). Euler's totient φ(53008) = 26496 numbers up to 53008 share no factor with it.
- 4
The digits of 53008 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 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53008 = 2^{4} \times 3313 \]53008 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 102734 |
| Euler totient φ(n) | 26496 |
| Square | 2809848064 |
| Cube | 148944426176512 |
| Square root | 230.234663 (= 4√3313) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.3008 × |
53008 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand and eight |
| Binary (base 2) | 1100111100010000 |
| Octal (base 8) | 147420 |
| Hexadecimal (base 16) | CF10 |
| Base 3 | 2200201021 |
| As time | 53008 seconds = 14 h 43 min 28 s |
Is 53008 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53008 ÷ 2 = 26504) | 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 (53008 ÷ 4 = 13252) | 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 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 | Yes (53008 ÷ 8 = 6626) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 53008 a prime number?
No. 53008 = × 3313, so it is divisible by 2.
What are the factors of 53008?
1, 2, 4, 8, 16, 3313, 6626, 13252, 26504, 53008.
What is 53008 in binary?
1100111100010000 (hexadecimal CF10, octal 147420).
What is the square root of 53008?
About 230.2347, exactly 4√3313.
Is 53008 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 53008?
53008 is a Harshad number: divisible by its digit sum 16.