The number 501
501 is a composite number with 4 divisors. Its prime factorisation is 3 × 167. Divisors (4): 1, 3, 167, 501.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 501: a semiprime: 3 × 167, the product of two primes.
- 2
501 is composite. Its prime factorisation is
- 3
The divisors add up to 672; without 501 itself that is 171, so 501 is deficient (171 is less than 501). Euler's totient φ(501) = 332 numbers up to 501 share no factor with it.
- 4
The digits of 501 add up to 6, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 110 steps to reach 1.
LaTeX source of the formulas on this page
\[ 501 = 3 \times 167 \]
501 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 672 |
| Euler totient φ(n) | 332 |
| Square | 251001 |
| Cube | 125751501 |
| Square root | 22.383029 |
| Digit sum / digital root | 6 / 6 |
| Collatz steps to 1 | 110 |
| Scientific notation | 5.01 × |
501 in other forms
| Form | Value |
|---|---|
| In words | five hundred and one |
| Roman numerals | DI |
| Binary (base 2) | 111110101 |
| Octal (base 8) | 765 |
| Hexadecimal (base 16) | 1F5 |
| Base 3 | 200120 |
| As time | 501 seconds = 8 min 21 s |
Is 501 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 (501 ÷ 3 = 167) | 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 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 5) | 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 6) | 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 501 a prime number?
No. 501 = 3 × 167, so it is divisible by 3.
What are the factors of 501?
1, 3, 167, 501.
What is 501 in binary?
111110101 (hexadecimal 1F5, octal 765).
What is the square root of 501?
About 22.3830.
What is 501 in Roman numerals?
DI.
Is 501 divisible by 3?
Yes. Its digits add up to 6, a multiple of 3.
What is special about the number 501?
501 is a semiprime: 3 × 167, the product of two primes.