The number 5001
5001 is a composite number with 4 divisors. Its prime factorisation is 3 × 1667. Divisors (4): 1, 3, 1667, 5001.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5001: a semiprime: 3 × 1667, the product of two primes.
- 2
5001 is composite. Its prime factorisation is
- 3
The divisors add up to 6672; without 5001 itself that is 1671, so 5001 is deficient (1671 is less than 5001). Euler's totient φ(5001) = 3332 numbers up to 5001 share no factor with it.
- 4
The digits of 5001 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 64 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5001 = 3 \times 1667 \]
5001 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 6672 |
| Euler totient φ(n) | 3332 |
| Square | 25010001 |
| Cube | 125075015001 |
| Square root | 70.717749 |
| Digit sum / digital root | 6 / 6 |
| Collatz steps to 1 | 64 |
| Scientific notation | 5.001 × |
5001 in other forms
| Form | Value |
|---|---|
| In words | five thousand and one |
| Binary (base 2) | 1001110001001 |
| Octal (base 8) | 11611 |
| Hexadecimal (base 16) | 1389 |
| Base 3 | 20212020 |
| As time | 5001 seconds = 1 h 23 min 21 s |
Is 5001 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 (5001 ÷ 3 = 1667) | 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 3) | 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 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5001 a prime number?
No. 5001 = 3 × 1667, so it is divisible by 3.
What are the factors of 5001?
1, 3, 1667, 5001.
What is 5001 in binary?
1001110001001 (hexadecimal 1389, octal 11611).
What is the square root of 5001?
About 70.7177.
Is 5001 divisible by 3?
Yes. Its digits add up to 6, a multiple of 3.
What is special about the number 5001?
5001 is a semiprime: 3 × 1667, the product of two primes.