The number 73051
73051 is a composite number with 8 divisors. Its prime factorisation is 11 × 29 × 229. Divisors (8): 1, 11, 29, 229, 319, 2519, 6641, 73051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
73051 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
73051 is composite. Its prime factorisation is
- 3
The divisors add up to 82800; without 73051 itself that is 9749, so 73051 is deficient (9749 is less than 73051). Euler's totient φ(73051) = 63840 numbers up to 73051 share no factor with it.
- 4
The digits of 73051 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 187 steps to reach 1.
LaTeX source of the formulas on this page
\[ 73051 = 11 \times 29 \times 229 \]
73051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 82800 |
| Euler totient φ(n) | 63840 |
| Square | 5336448601 |
| Cube | 389832906751651 |
| Square root | 270.279485 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 187 |
| Scientific notation | 7.3051 × |
73051 in other forms
| Form | Value |
|---|---|
| In words | seventy-three thousand and fifty-one |
| Binary (base 2) | 10001110101011011 |
| Octal (base 8) | 216533 |
| Hexadecimal (base 16) | 11D5B |
| Base 3 | 10201012121 |
| As time | 73051 seconds = 20 h 17 min 31 s |
Is 73051 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 1) | 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 6) | 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 3) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (73051 ÷ 11 = 6641) | 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 73051 a prime number?
No. 73051 = 11 × 29 × 229, so it is divisible by 11.
What are the factors of 73051?
1, 11, 29, 229, 319, 2519, 6641, 73051.
What is 73051 in binary?
10001110101011011 (hexadecimal 11D5B, octal 216533).
What is the square root of 73051?
About 270.2795.
Is 73051 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 73051?
It is a composite number with 8 divisors.