The number 1062
1062 is a composite number with 12 divisors. Its prime factorisation is 2 × × 59. Divisors (12): 1, 2, 3, 6, 9, 18, 59, 118, 177, 354, 531, 1062.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1062: a Harshad number: divisible by its digit sum 9.
- 2
1062 is composite. Its prime factorisation is
- 3
The divisors add up to 2340; without 1062 itself that is 1278, so 1062 is abundant (1278 is more than 1062). Euler's totient φ(1062) = 348 numbers up to 1062 share no factor with it.
- 4
The digits of 1062 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 124 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1062 = 2 \times 3^{2} \times 59 \]1062 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 2340 |
| Euler totient φ(n) | 348 |
| Square | 1127844 |
| Cube | 1197770328 |
| Square root | 32.588341 (= 3√118) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 124 |
| Scientific notation | 1.062 × |
1062 in other forms
| Form | Value |
|---|---|
| In words | one thousand and sixty-two |
| Roman numerals | MLXII |
| Binary (base 2) | 10000100110 |
| Octal (base 8) | 2046 |
| Hexadecimal (base 16) | 426 |
| Base 3 | 1110100 |
| As time | 1062 seconds = 17 min 42 s |
Is 1062 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1062 ÷ 2 = 531) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (1062 ÷ 3 = 354) | 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 | Yes (1062 ÷ 6 = 177) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (1062 ÷ 9 = 118) | 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 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1062 a prime number?
No. 1062 = 2 × × 59, so it is divisible by 2.
What are the factors of 1062?
1, 2, 3, 6, 9, 18, 59, 118, 177, 354, 531, 1062.
What is 1062 in binary?
10000100110 (hexadecimal 426, octal 2046).
What is the square root of 1062?
About 32.5883, exactly 3√118.
What is 1062 in Roman numerals?
MLXII.
Is 1062 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 1062?
1062 is a Harshad number: divisible by its digit sum 9.