The number 56071
56071 is a composite number with 4 divisors. Its prime factorisation is 47 × 1193. Divisors (4): 1, 47, 1193, 56071.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56071: a semiprime: 47 × 1193, the product of two primes.
- 2
56071 is composite. Its prime factorisation is
- 3
The divisors add up to 57312; without 56071 itself that is 1241, so 56071 is deficient (1241 is less than 56071). Euler's totient φ(56071) = 54832 numbers up to 56071 share no factor with it.
- 4
The digits of 56071 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 259 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56071 = 47 \times 1193 \]
56071 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 57312 |
| Euler totient φ(n) | 54832 |
| Square | 3143957041 |
| Cube | 176284815245911 |
| Square root | 236.793159 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 259 |
| Scientific notation | 5.6071 × |
56071 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and seventy-one |
| Binary (base 2) | 1101101100000111 |
| Octal (base 8) | 155407 |
| Hexadecimal (base 16) | DB07 |
| Base 3 | 2211220201 |
| As time | 56071 seconds = 15 h 34 min 31 s |
Is 56071 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 | No (remainder 1) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 7) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56071 a prime number?
No. 56071 = 47 × 1193, so it is divisible by 47.
What are the factors of 56071?
1, 47, 1193, 56071.
What is 56071 in binary?
1101101100000111 (hexadecimal DB07, octal 155407).
What is the square root of 56071?
About 236.7932.
Is 56071 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 56071?
56071 is a semiprime: 47 × 1193, the product of two primes.