The number 1059
1059 is a composite number with 4 divisors. Its prime factorisation is 3 × 353. Divisors (4): 1, 3, 353, 1059.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1059: a semiprime: 3 × 353, the product of two primes.
- 2
1059 is composite. Its prime factorisation is
- 3
The divisors add up to 1416; without 1059 itself that is 357, so 1059 is deficient (357 is less than 1059). Euler's totient φ(1059) = 704 numbers up to 1059 share no factor with it.
- 4
The digits of 1059 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 31 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1059 = 3 \times 353 \]
1059 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1416 |
| Euler totient φ(n) | 704 |
| Square | 1121481 |
| Cube | 1187648379 |
| Square root | 32.542280 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 31 |
| Scientific notation | 1.059 × |
1059 in other forms
| Form | Value |
|---|---|
| In words | one thousand and fifty-nine |
| Roman numerals | MLIX |
| Binary (base 2) | 10000100011 |
| Octal (base 8) | 2043 |
| Hexadecimal (base 16) | 423 |
| Base 3 | 1110020 |
| As time | 1059 seconds = 17 min 39 s |
Is 1059 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 (1059 ÷ 3 = 353) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 2) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1059 a prime number?
No. 1059 = 3 × 353, so it is divisible by 3.
What are the factors of 1059?
1, 3, 353, 1059.
What is 1059 in binary?
10000100011 (hexadecimal 423, octal 2043).
What is the square root of 1059?
About 32.5423.
What is 1059 in Roman numerals?
MLIX.
Is 1059 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 1059?
1059 is a semiprime: 3 × 353, the product of two primes.