The number 56059
56059 is a composite number with 4 divisors. Its prime factorisation is 61 × 919. Divisors (4): 1, 61, 919, 56059.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56059: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 61 × 919, the product of two primes.
- 2
56059 is composite. Its prime factorisation is
- 3
The divisors add up to 57040; without 56059 itself that is 981, so 56059 is deficient (981 is less than 56059). Euler's totient φ(56059) = 55080 numbers up to 56059 share no factor with it.
- 4
The digits of 56059 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56059 = 61 \times 919 \]
56059 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 57040 |
| Euler totient φ(n) | 55080 |
| Square | 3142611481 |
| Cube | 176171657013379 |
| Square root | 236.767819 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.6059 × |
56059 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and fifty-nine |
| Binary (base 2) | 1101101011111011 |
| Octal (base 8) | 155373 |
| Hexadecimal (base 16) | DAFB |
| Base 3 | 2211220021 |
| As time | 56059 seconds = 15 h 34 min 19 s |
Is 56059 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 | No (remainder 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 7) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56059 a prime number?
No. 56059 = 61 × 919, so it is divisible by 61.
What are the factors of 56059?
1, 61, 919, 56059.
What is 56059 in binary?
1101101011111011 (hexadecimal DAFB, octal 155373).
What is the square root of 56059?
About 236.7678.
Is 56059 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 56059?
56059 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 61 × 919, the product of two primes.