The number 4461
4461 is a composite number with 4 divisors. Its prime factorisation is 3 × 1487. Divisors (4): 1, 3, 1487, 4461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4461: a semiprime: 3 × 1487, the product of two primes.
- 2
4461 is composite. Its prime factorisation is
- 3
The divisors add up to 5952; without 4461 itself that is 1491, so 4461 is deficient (1491 is less than 4461). Euler's totient φ(4461) = 2972 numbers up to 4461 share no factor with it.
- 4
The digits of 4461 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 95 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4461 = 3 \times 1487 \]
4461 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 5952 |
| Euler totient φ(n) | 2972 |
| Square | 19900521 |
| Cube | 88776224181 |
| Square root | 66.790718 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 95 |
| Scientific notation | 4.461 × |
4461 in other forms
| Form | Value |
|---|---|
| In words | four thousand four hundred and sixty-one |
| Binary (base 2) | 1000101101101 |
| Octal (base 8) | 10555 |
| Hexadecimal (base 16) | 116D |
| Base 3 | 20010020 |
| As time | 4461 seconds = 1 h 14 min 21 s |
Is 4461 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 | Yes (4461 ÷ 3 = 1487) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 6) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 4461 a prime number?
No. 4461 = 3 × 1487, so it is divisible by 3.
What are the factors of 4461?
1, 3, 1487, 4461.
What is 4461 in binary?
1000101101101 (hexadecimal 116D, octal 10555).
What is the square root of 4461?
About 66.7907.
Is 4461 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 4461?
4461 is a semiprime: 3 × 1487, the product of two primes.