The number 5007
5007 is a composite number with 4 divisors. Its prime factorisation is 3 × 1669. Divisors (4): 1, 3, 1669, 5007.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5007: a semiprime: 3 × 1669, the product of two primes.
- 2
5007 is composite. Its prime factorisation is
- 3
The divisors add up to 6680; without 5007 itself that is 1673, so 5007 is deficient (1673 is less than 5007). Euler's totient φ(5007) = 3336 numbers up to 5007 share no factor with it.
- 4
The digits of 5007 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 64 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5007 = 3 \times 1669 \]
5007 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 6680 |
| Euler totient φ(n) | 3336 |
| Square | 25070049 |
| Cube | 125525735343 |
| Square root | 70.760158 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 64 |
| Scientific notation | 5.007 × |
5007 in other forms
| Form | Value |
|---|---|
| In words | five thousand and seven |
| Binary (base 2) | 1001110001111 |
| Octal (base 8) | 11617 |
| Hexadecimal (base 16) | 138F |
| Base 3 | 20212110 |
| As time | 5007 seconds = 1 h 23 min 27 s |
Is 5007 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 (5007 ÷ 3 = 1669) | 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 2) | 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 7) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 5007 a prime number?
No. 5007 = 3 × 1669, so it is divisible by 3.
What are the factors of 5007?
1, 3, 1669, 5007.
What is 5007 in binary?
1001110001111 (hexadecimal 138F, octal 11617).
What is the square root of 5007?
About 70.7602.
Is 5007 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 5007?
5007 is a semiprime: 3 × 1669, the product of two primes.