The number 51007
51007 is a composite number with 4 divisors. Its prime factorisation is 11 × 4637. Divisors (4): 1, 11, 4637, 51007.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51007: a semiprime: 11 × 4637, the product of two primes.
- 2
51007 is composite. Its prime factorisation is
- 3
The divisors add up to 55656; without 51007 itself that is 4649, so 51007 is deficient (4649 is less than 51007). Euler's totient φ(51007) = 46360 numbers up to 51007 share no factor with it.
- 4
The digits of 51007 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51007 = 11 \times 4637 \]
51007 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 55656 |
| Euler totient φ(n) | 46360 |
| Square | 2601714049 |
| Cube | 132705628497343 |
| Square root | 225.847294 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.1007 × |
51007 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and seven |
| Binary (base 2) | 1100011100111111 |
| Octal (base 8) | 143477 |
| Hexadecimal (base 16) | C73F |
| Base 3 | 2120222011 |
| As time | 51007 seconds = 14 h 10 min 7 s |
Is 51007 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 | No (remainder 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 4) | 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 | Yes (51007 ÷ 11 = 4637) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51007 a prime number?
No. 51007 = 11 × 4637, so it is divisible by 11.
What are the factors of 51007?
1, 11, 4637, 51007.
What is 51007 in binary?
1100011100111111 (hexadecimal C73F, octal 143477).
What is the square root of 51007?
About 225.8473.
Is 51007 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 51007?
51007 is a semiprime: 11 × 4637, the product of two primes.