The number 1546
1546 is a composite number with 4 divisors. Its prime factorisation is 2 × 773. Divisors (4): 1, 2, 773, 1546.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1546: a semiprime: 2 × 773, the product of two primes.
- 2
1546 is composite. Its prime factorisation is
- 3
The divisors add up to 2322; without 1546 itself that is 776, so 1546 is deficient (776 is less than 1546). Euler's totient φ(1546) = 772 numbers up to 1546 share no factor with it.
- 4
The digits of 1546 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 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1546 = 2 \times 773 \]
1546 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 2322 |
| Euler totient φ(n) | 772 |
| Square | 2390116 |
| Cube | 3695119336 |
| Square root | 39.319207 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 122 |
| Scientific notation | 1.546 × |
1546 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and forty-six |
| Roman numerals | MDXLVI |
| Binary (base 2) | 11000001010 |
| Octal (base 8) | 3012 |
| Hexadecimal (base 16) | 60A |
| Base 3 | 2010021 |
| As time | 1546 seconds = 25 min 46 s |
Is 1546 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1546 ÷ 2 = 773) | 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 2) | 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 4) | 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 2) | 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 6) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1546 a prime number?
No. 1546 = 2 × 773, so it is divisible by 2.
What are the factors of 1546?
1, 2, 773, 1546.
What is 1546 in binary?
11000001010 (hexadecimal 60A, octal 3012).
What is the square root of 1546?
About 39.3192.
What is 1546 in Roman numerals?
MDXLVI.
Is 1546 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 1546?
1546 is a semiprime: 2 × 773, the product of two primes.