The number 1562
1562 is a composite number with 8 divisors. Its prime factorisation is 2 × 11 × 71. Divisors (8): 1, 2, 11, 22, 71, 142, 781, 1562.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1562 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1562 is composite. Its prime factorisation is
- 3
The divisors add up to 2592; without 1562 itself that is 1030, so 1562 is deficient (1030 is less than 1562). Euler's totient φ(1562) = 700 numbers up to 1562 share no factor with it.
- 4
The digits of 1562 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1562 = 2 \times 11 \times 71 \]
1562 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 2592 |
| Euler totient φ(n) | 700 |
| Square | 2439844 |
| Cube | 3811036328 |
| Square root | 39.522146 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 122 |
| Scientific notation | 1.562 × |
1562 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and sixty-two |
| Roman numerals | MDLXII |
| Binary (base 2) | 11000011010 |
| Octal (base 8) | 3032 |
| Hexadecimal (base 16) | 61A |
| Base 3 | 2010212 |
| As time | 1562 seconds = 26 min 2 s |
Is 1562 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1562 ÷ 2 = 781) | 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 2) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (1562 ÷ 11 = 142) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1562 a prime number?
No. 1562 = 2 × 11 × 71, so it is divisible by 2.
What are the factors of 1562?
1, 2, 11, 22, 71, 142, 781, 1562.
What is 1562 in binary?
11000011010 (hexadecimal 61A, octal 3032).
What is the square root of 1562?
About 39.5221.
What is 1562 in Roman numerals?
MDLXII.
Is 1562 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 1562?
It is a composite number with 8 divisors.