The number 51153
51153 is a composite number with 12 divisors. Its prime factorisation is 3 × × 59. Divisors (12): 1, 3, 17, 51, 59, 177, 289, 867, 1003, 3009, 17051, 51153.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51153 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51153 is composite. Its prime factorisation is
- 3
The divisors add up to 73680; without 51153 itself that is 22527, so 51153 is deficient (22527 is less than 51153). Euler's totient φ(51153) = 31552 numbers up to 51153 share no factor with it.
- 4
The digits of 51153 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51153 = 3 \times 17^{2} \times 59 \]51153 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 73680 |
| Euler totient φ(n) | 31552 |
| Square | 2616629409 |
| Cube | 133848444158577 |
| Square root | 226.170290 (= 17√177) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.1153 × |
51153 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand one hundred and fifty-three |
| Binary (base 2) | 1100011111010001 |
| Octal (base 8) | 143721 |
| Hexadecimal (base 16) | C7D1 |
| Base 3 | 2121011120 |
| As time | 51153 seconds = 14 h 12 min 33 s |
Is 51153 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 (51153 ÷ 3 = 17051) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51153 a prime number?
No. 51153 = 3 × × 59, so it is divisible by 3.
What are the factors of 51153?
1, 3, 17, 51, 59, 177, 289, 867, 1003, 3009, 17051, 51153.
What is 51153 in binary?
1100011111010001 (hexadecimal C7D1, octal 143721).
What is the square root of 51153?
About 226.1703, exactly 17√177.
Is 51153 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 51153?
It is a composite number with 12 divisors.