The number 56938
56938 is a composite number with 16 divisors. Its prime factorisation is 2 × × 83. Divisors (16): 1, 2, 7, 14, 49, 83, 98, 166, 343, 581, 686, 1162, 4067, 8134, 28469, 56938.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56938 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56938 is composite. Its prime factorisation is
- 3
The divisors add up to 100800; without 56938 itself that is 43862, so 56938 is deficient (43862 is less than 56938). Euler's totient φ(56938) = 24108 numbers up to 56938 share no factor with it.
- 4
The digits of 56938 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56938 = 2 \times 7^{3} \times 83 \]56938 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 100800 |
| Euler totient φ(n) | 24108 |
| Square | 3241935844 |
| Cube | 184589343085672 |
| Square root | 238.616848 (= 7√1162) |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.6938 × |
56938 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand nine hundred and thirty-eight |
| Binary (base 2) | 1101111001101010 |
| Octal (base 8) | 157152 |
| Hexadecimal (base 16) | DE6A |
| Base 3 | 2220002211 |
| As time | 56938 seconds = 15 h 48 min 58 s |
Is 56938 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56938 ÷ 2 = 28469) | 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 | No (remainder 3) | 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 | Yes (56938 ÷ 7 = 8134) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56938 a prime number?
No. 56938 = 2 × × 83, so it is divisible by 2.
What are the factors of 56938?
1, 2, 7, 14, 49, 83, 98, 166, 343, 581, 686, 1162, 4067, 8134, 28469, 56938.
What is 56938 in binary?
1101111001101010 (hexadecimal DE6A, octal 157152).
What is the square root of 56938?
About 238.6168, exactly 7√1162.
Is 56938 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 56938?
It is a composite number with 16 divisors.