The number 1350
1350 is a composite number with 24 divisors. Its prime factorisation is 2 × × . Divisors (24): 1, 2, 3, 5, 6, 9, 10, 15, 18, 25, 27, 30, 45, 50, 54, 75 … 1350.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1350: a Harshad number: divisible by its digit sum 9.
- 2
1350 is composite. Its prime factorisation is
- 3
The divisors add up to 3720; without 1350 itself that is 2370, so 1350 is abundant (2370 is more than 1350). Euler's totient φ(1350) = 360 numbers up to 1350 share no factor with it.
- 4
The digits of 1350 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 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1350 = 2 \times 3^{3} \times 5^{2} \]1350 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 3720 |
| Euler totient φ(n) | 360 |
| Square | 1822500 |
| Cube | 2460375000 |
| Square root | 36.742346 (= 15√6) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 114 |
| Scientific notation | 1.35 × |
1350 in other forms
| Form | Value |
|---|---|
| In words | one thousand three hundred and fifty |
| Roman numerals | MCCCL |
| Binary (base 2) | 10101000110 |
| Octal (base 8) | 2506 |
| Hexadecimal (base 16) | 546 |
| Base 3 | 1212000 |
| As time | 1350 seconds = 22 min 30 s |
Is 1350 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1350 ÷ 2 = 675) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (1350 ÷ 3 = 450) | 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 | Yes (1350 ÷ 5 = 270) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (1350 ÷ 6 = 225) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 (1350 ÷ 9 = 150) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (1350 ÷ 10 = 135) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 1350 a prime number?
No. 1350 = 2 × × , so it is divisible by 2.
What are the factors of 1350?
1, 2, 3, 5, 6, 9, 10, 15, 18, 25, 27, 30, 45, 50, 54, 75, 90, 135, 150, 225, 270, 450, 675, 1350.
What is 1350 in binary?
10101000110 (hexadecimal 546, octal 2506).
What is the square root of 1350?
About 36.7423, exactly 15√6.
What is 1350 in Roman numerals?
MCCCL.
Is 1350 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 1350?
1350 is a Harshad number: divisible by its digit sum 9.