The number 56098
56098 is a composite number with 8 divisors. Its prime factorisation is 2 × 7 × 4007. Divisors (8): 1, 2, 7, 14, 4007, 8014, 28049, 56098.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56098 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56098 is composite. Its prime factorisation is
- 3
The divisors add up to 96192; without 56098 itself that is 40094, so 56098 is deficient (40094 is less than 56098). Euler's totient φ(56098) = 24036 numbers up to 56098 share no factor with it.
- 4
The digits of 56098 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56098 = 2 \times 7 \times 4007 \]
56098 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 96192 |
| Euler totient φ(n) | 24036 |
| Square | 3146985604 |
| Cube | 176539598413192 |
| Square root | 236.850164 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.6098 × |
56098 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and ninety-eight |
| Binary (base 2) | 1101101100100010 |
| Octal (base 8) | 155442 |
| Hexadecimal (base 16) | DB22 |
| Base 3 | 2211221201 |
| As time | 56098 seconds = 15 h 34 min 58 s |
Is 56098 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56098 ÷ 2 = 28049) | 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 (56098 ÷ 7 = 8014) | 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 1) | 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 9) | 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 56098 a prime number?
No. 56098 = 2 × 7 × 4007, so it is divisible by 2.
What are the factors of 56098?
1, 2, 7, 14, 4007, 8014, 28049, 56098.
What is 56098 in binary?
1101101100100010 (hexadecimal DB22, octal 155442).
What is the square root of 56098?
About 236.8502.
Is 56098 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 56098?
It is a composite number with 8 divisors.