The number 56151
56151 is a composite number with 12 divisors. Its prime factorisation is × 17 × 367. Divisors (12): 1, 3, 9, 17, 51, 153, 367, 1101, 3303, 6239, 18717, 56151.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56151 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56151 is composite. Its prime factorisation is
- 3
The divisors add up to 86112; without 56151 itself that is 29961, so 56151 is deficient (29961 is less than 56151). Euler's totient φ(56151) = 35136 numbers up to 56151 share no factor with it.
- 4
The digits of 56151 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56151 = 3^{2} \times 17 \times 367 \]56151 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 86112 |
| Euler totient φ(n) | 35136 |
| Square | 3152934801 |
| Cube | 177040442010951 |
| Square root | 236.962022 (= 3√6239) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.6151 × |
56151 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand one hundred and fifty-one |
| Binary (base 2) | 1101101101010111 |
| Octal (base 8) | 155527 |
| Hexadecimal (base 16) | DB57 |
| Base 3 | 2212000200 |
| As time | 56151 seconds = 15 h 35 min 51 s |
Is 56151 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 | Yes (56151 ÷ 3 = 18717) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 | Yes (56151 ÷ 9 = 6239) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56151 a prime number?
No. 56151 = × 17 × 367, so it is divisible by 3.
What are the factors of 56151?
1, 3, 9, 17, 51, 153, 367, 1101, 3303, 6239, 18717, 56151.
What is 56151 in binary?
1101101101010111 (hexadecimal DB57, octal 155527).
What is the square root of 56151?
About 236.9620, exactly 3√6239.
Is 56151 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 56151?
It is a composite number with 12 divisors.