The number 56079
56079 is a composite number with 16 divisors. Its prime factorisation is × 31 × 67. Divisors (16): 1, 3, 9, 27, 31, 67, 93, 201, 279, 603, 837, 1809, 2077, 6231, 18693, 56079.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56079: a Harshad number: divisible by its digit sum 27.
- 2
56079 is composite. Its prime factorisation is
- 3
The divisors add up to 87040; without 56079 itself that is 30961, so 56079 is deficient (30961 is less than 56079). Euler's totient φ(56079) = 35640 numbers up to 56079 share no factor with it.
- 4
The digits of 56079 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56079 = 3^{3} \times 31 \times 67 \]56079 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 87040 |
| Euler totient φ(n) | 35640 |
| Square | 3144854241 |
| Cube | 176360280981039 |
| Square root | 236.810050 (= 3√6231) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 34 |
| Scientific notation | 5.6079 × |
56079 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and seventy-nine |
| Binary (base 2) | 1101101100001111 |
| Octal (base 8) | 155417 |
| Hexadecimal (base 16) | DB0F |
| Base 3 | 2211221000 |
| As time | 56079 seconds = 15 h 34 min 39 s |
Is 56079 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 (56079 ÷ 3 = 18693) | 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 4) | 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 2) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (56079 ÷ 9 = 6231) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 56079 a prime number?
No. 56079 = × 31 × 67, so it is divisible by 3.
What are the factors of 56079?
1, 3, 9, 27, 31, 67, 93, 201, 279, 603, 837, 1809, 2077, 6231, 18693, 56079.
What is 56079 in binary?
1101101100001111 (hexadecimal DB0F, octal 155417).
What is the square root of 56079?
About 236.8101, exactly 3√6231.
Is 56079 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 56079?
56079 is a Harshad number: divisible by its digit sum 27.