The number 56351
56351 is a composite number with 4 divisors. Its prime factorisation is 37 × 1523. Divisors (4): 1, 37, 1523, 56351.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56351: a semiprime: 37 × 1523, the product of two primes.
- 2
56351 is composite. Its prime factorisation is
- 3
The divisors add up to 57912; without 56351 itself that is 1561, so 56351 is deficient (1561 is less than 56351). Euler's totient φ(56351) = 54792 numbers up to 56351 share no factor with it.
- 4
The digits of 56351 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56351 = 37 \times 1523 \]
56351 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 57912 |
| Euler totient φ(n) | 54792 |
| Square | 3175435201 |
| Cube | 178938949011551 |
| Square root | 237.383656 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 135 |
| Scientific notation | 5.6351 × |
56351 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand three hundred and fifty-one |
| Binary (base 2) | 1101110000011111 |
| Octal (base 8) | 156037 |
| Hexadecimal (base 16) | DC1F |
| Base 3 | 2212022002 |
| As time | 56351 seconds = 15 h 39 min 11 s |
Is 56351 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 2) | 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 5) | 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 2) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56351 a prime number?
No. 56351 = 37 × 1523, so it is divisible by 37.
What are the factors of 56351?
1, 37, 1523, 56351.
What is 56351 in binary?
1101110000011111 (hexadecimal DC1F, octal 156037).
What is the square root of 56351?
About 237.3837.
Is 56351 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 56351?
56351 is a semiprime: 37 × 1523, the product of two primes.