The number 53001
53001 is a composite number with 16 divisors. Its prime factorisation is × 13 × 151. Divisors (16): 1, 3, 9, 13, 27, 39, 117, 151, 351, 453, 1359, 1963, 4077, 5889, 17667, 53001.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53001: a Harshad number: divisible by its digit sum 9.
- 2
53001 is composite. Its prime factorisation is
- 3
The divisors add up to 85120; without 53001 itself that is 32119, so 53001 is deficient (32119 is less than 53001). Euler's totient φ(53001) = 32400 numbers up to 53001 share no factor with it.
- 4
The digits of 53001 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 246 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53001 = 3^{3} \times 13 \times 151 \]53001 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 85120 |
| Euler totient φ(n) | 32400 |
| Square | 2809106001 |
| Cube | 148885427159001 |
| Square root | 230.219461 (= 3√5889) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 246 |
| Scientific notation | 5.3001 × |
53001 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand and one |
| Binary (base 2) | 1100111100001001 |
| Octal (base 8) | 147411 |
| Hexadecimal (base 16) | CF09 |
| Base 3 | 2200201000 |
| As time | 53001 seconds = 14 h 43 min 21 s |
Is 53001 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 (53001 ÷ 3 = 17667) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (53001 ÷ 9 = 5889) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53001 a prime number?
No. 53001 = × 13 × 151, so it is divisible by 3.
What are the factors of 53001?
1, 3, 9, 13, 27, 39, 117, 151, 351, 453, 1359, 1963, 4077, 5889, 17667, 53001.
What is 53001 in binary?
1100111100001001 (hexadecimal CF09, octal 147411).
What is the square root of 53001?
About 230.2195, exactly 3√5889.
Is 53001 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 53001?
53001 is a Harshad number: divisible by its digit sum 9.