The number 1058
1058 is a composite number with 6 divisors. Its prime factorisation is 2 Ć . Divisors (6): 1, 2, 23, 46, 529, 1058.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1058 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1058 is composite. Its prime factorisation is
- 3
The divisors add up to 1659; without 1058 itself that is 601, so 1058 is deficient (601 is less than 1058). Euler's totient Ļ(1058) = 506 numbers up to 1058 share no factor with it.
- 4
The digits of 1058 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 31 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1058 = 2 \times 23^{2} \]1058 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 1659 |
| Euler totient Ļ(n) | 506 |
| Square | 1119364 |
| Cube | 1184287112 |
| Square root | 32.526912 (= 23ā2) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 31 |
| Scientific notation | 1.058 Ć |
1058 in other forms
| Form | Value |
|---|---|
| In words | one thousand and fifty-eight |
| Roman numerals | MLVIII |
| Binary (base 2) | 10000100010 |
| Octal (base 8) | 2042 |
| Hexadecimal (base 16) | 422 |
| Base 3 | 1110012 |
| As time | 1058 seconds = 17 min 38 s |
Is 1058 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1058 Ć· 2 = 529) | 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 3) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 1058 a prime number?
No. 1058 = 2 Ć , so it is divisible by 2.
What are the factors of 1058?
1, 2, 23, 46, 529, 1058.
What is 1058 in binary?
10000100010 (hexadecimal 422, octal 2042).
What is the square root of 1058?
About 32.5269, exactly 23ā2.
What is 1058 in Roman numerals?
MLVIII.
Is 1058 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 1058?
It is a composite number with 6 divisors.