The number 56950
56950 is a composite number with 24 divisors. Its prime factorisation is 2 × × 17 × 67. Divisors (24): 1, 2, 5, 10, 17, 25, 34, 50, 67, 85, 134, 170, 335, 425, 670, 850 … 56950.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56950: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 25.
- 2
56950 is composite. Its prime factorisation is
- 3
The divisors add up to 113832; without 56950 itself that is 56882, so 56950 is deficient (56882 is less than 56950). Euler's totient φ(56950) = 21120 numbers up to 56950 share no factor with it.
- 4
The digits of 56950 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 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56950 = 2 \times 5^{2} \times 17 \times 67 \]56950 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 113832 |
| Euler totient φ(n) | 21120 |
| Square | 3243302500 |
| Cube | 184706077375000 |
| Square root | 238.641991 (= 5√2278) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 52 |
| Scientific notation | 5.695 × |
56950 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand nine hundred and fifty |
| Binary (base 2) | 1101111001110110 |
| Octal (base 8) | 157166 |
| Hexadecimal (base 16) | DE76 |
| Base 3 | 2220010021 |
| As time | 56950 seconds = 15 h 49 min 10 s |
Is 56950 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56950 ÷ 2 = 28475) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (56950 ÷ 5 = 11390) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 6) | 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 | Yes (56950 ÷ 10 = 5695) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56950 a prime number?
No. 56950 = 2 × × 17 × 67, so it is divisible by 2.
What are the factors of 56950?
1, 2, 5, 10, 17, 25, 34, 50, 67, 85, 134, 170, 335, 425, 670, 850, 1139, 1675, 2278, 3350, 5695, 11390, 28475, 56950.
What is 56950 in binary?
1101111001110110 (hexadecimal DE76, octal 157166).
What is the square root of 56950?
About 238.6420, exactly 5√2278.
Is 56950 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 56950?
56950 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 25.