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