The number 56091
56091 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 2671. Divisors (8): 1, 3, 7, 21, 2671, 8013, 18697, 56091.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56091: a Harshad number: divisible by its digit sum 21.
- 2
56091 is composite. Its prime factorisation is
- 3
The divisors add up to 85504; without 56091 itself that is 29413, so 56091 is deficient (29413 is less than 56091). Euler's totient φ(56091) = 32040 numbers up to 56091 share no factor with it.
- 4
The digits of 56091 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56091 = 3 \times 7 \times 2671 \]
56091 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 85504 |
| Euler totient φ(n) | 32040 |
| Square | 3146200281 |
| Cube | 176473519961571 |
| Square root | 236.835386 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.6091 × |
56091 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and ninety-one |
| Binary (base 2) | 1101101100011011 |
| Octal (base 8) | 155433 |
| Hexadecimal (base 16) | DB1B |
| Base 3 | 2211221110 |
| As time | 56091 seconds = 15 h 34 min 51 s |
Is 56091 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 (56091 ÷ 3 = 18697) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 (56091 ÷ 7 = 8013) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56091 a prime number?
No. 56091 = 3 × 7 × 2671, so it is divisible by 3.
What are the factors of 56091?
1, 3, 7, 21, 2671, 8013, 18697, 56091.
What is 56091 in binary?
1101101100011011 (hexadecimal DB1B, octal 155433).
What is the square root of 56091?
About 236.8354.
Is 56091 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 56091?
56091 is a Harshad number: divisible by its digit sum 21.