The number 56259
56259 is a composite number with 24 divisors. Its prime factorisation is × 7 × 19 × 47. Divisors (24): 1, 3, 7, 9, 19, 21, 47, 57, 63, 133, 141, 171, 329, 399, 423, 893 … 56259.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56259 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56259 is composite. Its prime factorisation is
- 3
The divisors add up to 99840; without 56259 itself that is 43581, so 56259 is deficient (43581 is less than 56259). Euler's totient φ(56259) = 29808 numbers up to 56259 share no factor with it.
- 4
The digits of 56259 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 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56259 = 3^{2} \times 7 \times 19 \times 47 \]56259 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 99840 |
| Euler totient φ(n) | 29808 |
| Square | 3165075081 |
| Cube | 178063958981979 |
| Square root | 237.189797 (= 3√6251) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 83 |
| Scientific notation | 5.6259 × |
56259 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand two hundred and fifty-nine |
| Binary (base 2) | 1101101111000011 |
| Octal (base 8) | 155703 |
| Hexadecimal (base 16) | DBC3 |
| Base 3 | 2212011200 |
| As time | 56259 seconds = 15 h 37 min 39 s |
Is 56259 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 (56259 ÷ 3 = 18753) | 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 | Yes (56259 ÷ 7 = 8037) | 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 | Yes (56259 ÷ 9 = 6251) | 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 5) | 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 56259 a prime number?
No. 56259 = × 7 × 19 × 47, so it is divisible by 3.
What are the factors of 56259?
1, 3, 7, 9, 19, 21, 47, 57, 63, 133, 141, 171, 329, 399, 423, 893, 987, 1197, 2679, 2961, 6251, 8037, 18753, 56259.
What is 56259 in binary?
1101101111000011 (hexadecimal DBC3, octal 155703).
What is the square root of 56259?
About 237.1898, exactly 3√6251.
Is 56259 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 56259?
It is a composite number with 24 divisors.