The number 51531
51531 is a composite number with 8 divisors. Its prime factorisation is 3 × 89 × 193. Divisors (8): 1, 3, 89, 193, 267, 579, 17177, 51531.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51531 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51531 is composite. Its prime factorisation is
- 3
The divisors add up to 69840; without 51531 itself that is 18309, so 51531 is deficient (18309 is less than 51531). Euler's totient φ(51531) = 33792 numbers up to 51531 share no factor with it.
- 4
The digits of 51531 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 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51531 = 3 \times 89 \times 193 \]
51531 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 69840 |
| Euler totient φ(n) | 33792 |
| Square | 2655443961 |
| Cube | 136837682754291 |
| Square root | 227.004405 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.1531 × |
51531 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand five hundred and thirty-one |
| Binary (base 2) | 1100100101001011 |
| Octal (base 8) | 144513 |
| Hexadecimal (base 16) | C94B |
| Base 3 | 2121200120 |
| As time | 51531 seconds = 14 h 18 min 51 s |
Is 51531 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 (51531 ÷ 3 = 17177) | 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 3) | 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 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 51531 a prime number?
No. 51531 = 3 × 89 × 193, so it is divisible by 3.
What are the factors of 51531?
1, 3, 89, 193, 267, 579, 17177, 51531.
What is 51531 in binary?
1100100101001011 (hexadecimal C94B, octal 144513).
What is the square root of 51531?
About 227.0044.
Is 51531 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 51531?
It is a composite number with 8 divisors.