The number 56062
56062 is a composite number with 4 divisors. Its prime factorisation is 2 × 28031. Divisors (4): 1, 2, 28031, 56062.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56062: a semiprime: 2 × 28031, the product of two primes.
- 2
56062 is composite. Its prime factorisation is
- 3
The divisors add up to 84096; without 56062 itself that is 28034, so 56062 is deficient (28034 is less than 56062). Euler's totient φ(56062) = 28030 numbers up to 56062 share no factor with it.
- 4
The digits of 56062 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56062 = 2 \times 28031 \]
56062 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 84096 |
| Euler totient φ(n) | 28030 |
| Square | 3142947844 |
| Cube | 176199942030328 |
| Square root | 236.774154 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.6062 × |
56062 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and sixty-two |
| Binary (base 2) | 1101101011111110 |
| Octal (base 8) | 155376 |
| Hexadecimal (base 16) | DAFE |
| Base 3 | 2211220101 |
| As time | 56062 seconds = 15 h 34 min 22 s |
Is 56062 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56062 ÷ 2 = 28031) | 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 2) | 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 6) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 56062 a prime number?
No. 56062 = 2 × 28031, so it is divisible by 2.
What are the factors of 56062?
1, 2, 28031, 56062.
What is 56062 in binary?
1101101011111110 (hexadecimal DAFE, octal 155376).
What is the square root of 56062?
About 236.7742.
Is 56062 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 56062?
56062 is a semiprime: 2 × 28031, the product of two primes.