The number 1359
1359 is a composite number with 6 divisors. Its prime factorisation is × 151. Divisors (6): 1, 3, 9, 151, 453, 1359.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1359 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1359 is composite. Its prime factorisation is
- 3
The divisors add up to 1976; without 1359 itself that is 617, so 1359 is deficient (617 is less than 1359). Euler's totient φ(1359) = 900 numbers up to 1359 share no factor with it.
- 4
The digits of 1359 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1359 = 3^{2} \times 151 \]1359 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 1976 |
| Euler totient φ(n) | 900 |
| Square | 1846881 |
| Cube | 2509911279 |
| Square root | 36.864617 (= 3√151) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 65 |
| Scientific notation | 1.359 × |
1359 in other forms
| Form | Value |
|---|---|
| In words | one thousand three hundred and fifty-nine |
| Roman numerals | MCCCLIX |
| Binary (base 2) | 10101001111 |
| Octal (base 8) | 2517 |
| Hexadecimal (base 16) | 54F |
| Base 3 | 1212100 |
| As time | 1359 seconds = 22 min 39 s |
Is 1359 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 (1359 ÷ 3 = 453) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (1359 ÷ 9 = 151) | 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 6) | 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 1359 a prime number?
No. 1359 = × 151, so it is divisible by 3.
What are the factors of 1359?
1, 3, 9, 151, 453, 1359.
What is 1359 in binary?
10101001111 (hexadecimal 54F, octal 2517).
What is the square root of 1359?
About 36.8646, exactly 3√151.
What is 1359 in Roman numerals?
MCCCLIX.
Is 1359 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 1359?
It is a composite number with 6 divisors.