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