The number 4501
4501 is a composite number with 4 divisors. Its prime factorisation is 7 × 643. Divisors (4): 1, 7, 643, 4501.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4501: a semiprime: 7 × 643, the product of two primes.
- 2
4501 is composite. Its prime factorisation is
- 3
The divisors add up to 5152; without 4501 itself that is 651, so 4501 is deficient (651 is less than 4501). Euler's totient φ(4501) = 3852 numbers up to 4501 share no factor with it.
- 4
The digits of 4501 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 46 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4501 = 7 \times 643 \]
4501 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 5152 |
| Euler totient φ(n) | 3852 |
| Square | 20259001 |
| Cube | 91185763501 |
| Square root | 67.089492 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 46 |
| Scientific notation | 4.501 × |
4501 in other forms
| Form | Value |
|---|---|
| In words | four thousand five hundred and one |
| Binary (base 2) | 1000110010101 |
| Octal (base 8) | 10625 |
| Hexadecimal (base 16) | 1195 |
| Base 3 | 20011201 |
| As time | 4501 seconds = 1 h 15 min 1 s |
Is 4501 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 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 | Yes (4501 ÷ 7 = 643) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 | No (remainder 2) | 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 4501 a prime number?
No. 4501 = 7 × 643, so it is divisible by 7.
What are the factors of 4501?
1, 7, 643, 4501.
What is 4501 in binary?
1000110010101 (hexadecimal 1195, octal 10625).
What is the square root of 4501?
About 67.0895.
Is 4501 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 4501?
4501 is a semiprime: 7 × 643, the product of two primes.