The number 1250
1250 is a composite number with 10 divisors. Its prime factorisation is 2 × . Divisors (10): 1, 2, 5, 10, 25, 50, 125, 250, 625, 1250.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1250 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1250 is composite. Its prime factorisation is
- 3
The divisors add up to 2343; without 1250 itself that is 1093, so 1250 is deficient (1093 is less than 1250). Euler's totient φ(1250) = 500 numbers up to 1250 share no factor with it.
- 4
The digits of 1250 add up to 8, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 26 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1250 = 2 \times 5^{4} \]1250 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 2343 |
| Euler totient φ(n) | 500 |
| Square | 1562500 |
| Cube | 1953125000 |
| Square root | 35.355339 (= 25√2) |
| Digit sum / digital root | 8 / 8 |
| Collatz steps to 1 | 26 |
| Scientific notation | 1.25 × |
1250 in other forms
| Form | Value |
|---|---|
| In words | one thousand two hundred and fifty |
| Roman numerals | MCCL |
| Binary (base 2) | 10011100010 |
| Octal (base 8) | 2342 |
| Hexadecimal (base 16) | 4E2 |
| Base 3 | 1201022 |
| As time | 1250 seconds = 20 min 50 s |
Is 1250 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1250 ÷ 2 = 625) | 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 | Yes (1250 ÷ 5 = 250) | 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 4) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (1250 ÷ 10 = 125) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 1250 a prime number?
No. 1250 = 2 × , so it is divisible by 2.
What are the factors of 1250?
1, 2, 5, 10, 25, 50, 125, 250, 625, 1250.
What is 1250 in binary?
10011100010 (hexadecimal 4E2, octal 2342).
What is the square root of 1250?
About 35.3553, exactly 25√2.
What is 1250 in Roman numerals?
MCCL.
Is 1250 divisible by 3?
No. Its digits add up to 8, which is not a multiple of 3.
What is special about the number 1250?
It is a composite number with 10 divisors.