The number 5006
5006 is a composite number with 4 divisors. Its prime factorisation is 2 × 2503. Divisors (4): 1, 2, 2503, 5006.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5006: a semiprime: 2 × 2503, the product of two primes.
- 2
5006 is composite. Its prime factorisation is
- 3
The divisors add up to 7512; without 5006 itself that is 2506, so 5006 is deficient (2506 is less than 5006). Euler's totient φ(5006) = 2502 numbers up to 5006 share no factor with it.
- 4
The digits of 5006 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 64 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5006 = 2 \times 2503 \]
5006 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 7512 |
| Euler totient φ(n) | 2502 |
| Square | 25060036 |
| Cube | 125450540216 |
| Square root | 70.753092 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 64 |
| Scientific notation | 5.006 × |
5006 in other forms
| Form | Value |
|---|---|
| In words | five thousand and six |
| Binary (base 2) | 1001110001110 |
| Octal (base 8) | 11616 |
| Hexadecimal (base 16) | 138E |
| Base 3 | 20212102 |
| As time | 5006 seconds = 1 h 23 min 26 s |
Is 5006 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5006 ÷ 2 = 2503) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5006 a prime number?
No. 5006 = 2 × 2503, so it is divisible by 2.
What are the factors of 5006?
1, 2, 2503, 5006.
What is 5006 in binary?
1001110001110 (hexadecimal 138E, octal 11616).
What is the square root of 5006?
About 70.7531.
Is 5006 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 5006?
5006 is a semiprime: 2 × 2503, the product of two primes.