The number 53151
53151 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 2531. Divisors (8): 1, 3, 7, 21, 2531, 7593, 17717, 53151.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53151 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53151 is composite. Its prime factorisation is
- 3
The divisors add up to 81024; without 53151 itself that is 27873, so 53151 is deficient (27873 is less than 53151). Euler's totient φ(53151) = 30360 numbers up to 53151 share no factor with it.
- 4
The digits of 53151 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
\[ 53151 = 3 \times 7 \times 2531 \]
53151 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 81024 |
| Euler totient φ(n) | 30360 |
| Square | 2825028801 |
| Cube | 150153105801951 |
| Square root | 230.545006 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.3151 × |
53151 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand one hundred and fifty-one |
| Binary (base 2) | 1100111110011111 |
| Octal (base 8) | 147637 |
| Hexadecimal (base 16) | CF9F |
| Base 3 | 2200220120 |
| As time | 53151 seconds = 14 h 45 min 51 s |
Is 53151 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 (53151 ÷ 3 = 17717) | 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 | Yes (53151 ÷ 7 = 7593) | 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 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 10) | 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 53151 a prime number?
No. 53151 = 3 × 7 × 2531, so it is divisible by 3.
What are the factors of 53151?
1, 3, 7, 21, 2531, 7593, 17717, 53151.
What is 53151 in binary?
1100111110011111 (hexadecimal CF9F, octal 147637).
What is the square root of 53151?
About 230.5450.
Is 53151 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 53151?
It is a composite number with 8 divisors.