The number 1450
1450 is a composite number with 12 divisors. Its prime factorisation is 2 × × 29. Divisors (12): 1, 2, 5, 10, 25, 29, 50, 58, 145, 290, 725, 1450.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1450: a Harshad number: divisible by its digit sum 10.
- 2
1450 is composite. Its prime factorisation is
- 3
The divisors add up to 2790; without 1450 itself that is 1340, so 1450 is deficient (1340 is less than 1450). Euler's totient φ(1450) = 560 numbers up to 1450 share no factor with it.
- 4
The digits of 1450 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 21 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1450 = 2 \times 5^{2} \times 29 \]1450 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 2790 |
| Euler totient φ(n) | 560 |
| Square | 2102500 |
| Cube | 3048625000 |
| Square root | 38.078866 (= 5√58) |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 21 |
| Scientific notation | 1.45 × |
1450 in other forms
| Form | Value |
|---|---|
| In words | one thousand four hundred and fifty |
| Roman numerals | MCDL |
| Binary (base 2) | 10110101010 |
| Octal (base 8) | 2652 |
| Hexadecimal (base 16) | 5AA |
| Base 3 | 1222201 |
| As time | 1450 seconds = 24 min 10 s |
Is 1450 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1450 ÷ 2 = 725) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 (1450 ÷ 5 = 290) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (1450 ÷ 10 = 145) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1450 a prime number?
No. 1450 = 2 × × 29, so it is divisible by 2.
What are the factors of 1450?
1, 2, 5, 10, 25, 29, 50, 58, 145, 290, 725, 1450.
What is 1450 in binary?
10110101010 (hexadecimal 5AA, octal 2652).
What is the square root of 1450?
About 38.0789, exactly 5√58.
What is 1450 in Roman numerals?
MCDL.
Is 1450 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 1450?
1450 is a Harshad number: divisible by its digit sum 10.