The number 56301
56301 is a composite number with 12 divisors. Its prime factorisation is 3 × × 383. Divisors (12): 1, 3, 7, 21, 49, 147, 383, 1149, 2681, 8043, 18767, 56301.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56301 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56301 is composite. Its prime factorisation is
- 3
The divisors add up to 87552; without 56301 itself that is 31251, so 56301 is deficient (31251 is less than 56301). Euler's totient φ(56301) = 32088 numbers up to 56301 share no factor with it.
- 4
The digits of 56301 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56301 = 3 \times 7^{2} \times 383 \]56301 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 87552 |
| Euler totient φ(n) | 32088 |
| Square | 3169802601 |
| Cube | 178463056238901 |
| Square root | 237.278318 (= 7√1149) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.6301 × |
56301 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand three hundred and one |
| Binary (base 2) | 1101101111101101 |
| Octal (base 8) | 155755 |
| Hexadecimal (base 16) | DBED |
| Base 3 | 2212020020 |
| As time | 56301 seconds = 15 h 38 min 21 s |
Is 56301 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 (56301 ÷ 3 = 18767) | 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 | Yes (56301 ÷ 7 = 8043) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 56301 a prime number?
No. 56301 = 3 × × 383, so it is divisible by 3.
What are the factors of 56301?
1, 3, 7, 21, 49, 147, 383, 1149, 2681, 8043, 18767, 56301.
What is 56301 in binary?
1101101111101101 (hexadecimal DBED, octal 155755).
What is the square root of 56301?
About 237.2783, exactly 7√1149.
Is 56301 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 56301?
It is a composite number with 12 divisors.