The number 51501
51501 is a composite number with 4 divisors. Its prime factorisation is 3 × 17167. Divisors (4): 1, 3, 17167, 51501.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51501: a semiprime: 3 × 17167, the product of two primes.
- 2
51501 is composite. Its prime factorisation is
- 3
The divisors add up to 68672; without 51501 itself that is 17171, so 51501 is deficient (17171 is less than 51501). Euler's totient φ(51501) = 34332 numbers up to 51501 share no factor with it.
- 4
The digits of 51501 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51501 = 3 \times 17167 \]
51501 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 68672 |
| Euler totient φ(n) | 34332 |
| Square | 2652353001 |
| Cube | 136598831904501 |
| Square root | 226.938318 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.1501 × |
51501 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand five hundred and one |
| Binary (base 2) | 1100100100101101 |
| Octal (base 8) | 144455 |
| Hexadecimal (base 16) | C92D |
| Base 3 | 2121122110 |
| As time | 51501 seconds = 14 h 18 min 21 s |
Is 51501 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 (51501 ÷ 3 = 17167) | 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 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 2) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51501 a prime number?
No. 51501 = 3 × 17167, so it is divisible by 3.
What are the factors of 51501?
1, 3, 17167, 51501.
What is 51501 in binary?
1100100100101101 (hexadecimal C92D, octal 144455).
What is the square root of 51501?
About 226.9383.
Is 51501 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 51501?
51501 is a semiprime: 3 × 17167, the product of two primes.