The number 1461
1461 is a composite number with 4 divisors. Its prime factorisation is 3 × 487. Divisors (4): 1, 3, 487, 1461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1461: a semiprime: 3 × 487, the product of two primes.
- 2
1461 is composite. Its prime factorisation is
- 3
The divisors add up to 1952; without 1461 itself that is 491, so 1461 is deficient (491 is less than 1461). Euler's totient φ(1461) = 972 numbers up to 1461 share no factor with it.
- 4
The digits of 1461 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1461 = 3 \times 487 \]
1461 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1952 |
| Euler totient φ(n) | 972 |
| Square | 2134521 |
| Cube | 3118535181 |
| Square root | 38.223030 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 96 |
| Scientific notation | 1.461 × |
1461 in other forms
| Form | Value |
|---|---|
| In words | one thousand four hundred and sixty-one |
| Roman numerals | MCDLXI |
| Binary (base 2) | 10110110101 |
| Octal (base 8) | 2665 |
| Hexadecimal (base 16) | 5B5 |
| Base 3 | 2000010 |
| As time | 1461 seconds = 24 min 21 s |
Is 1461 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 (1461 ÷ 3 = 487) | 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 5) | 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 3) | 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 9) | 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 1461 a prime number?
No. 1461 = 3 × 487, so it is divisible by 3.
What are the factors of 1461?
1, 3, 487, 1461.
What is 1461 in binary?
10110110101 (hexadecimal 5B5, octal 2665).
What is the square root of 1461?
About 38.2230.
What is 1461 in Roman numerals?
MCDLXI.
Is 1461 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 1461?
1461 is a semiprime: 3 × 487, the product of two primes.