The number 1257
1257 is a composite number with 4 divisors. Its prime factorisation is 3 × 419. Divisors (4): 1, 3, 419, 1257.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1257: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 419, the product of two primes.
- 2
1257 is composite. Its prime factorisation is
- 3
The divisors add up to 1680; without 1257 itself that is 423, so 1257 is deficient (423 is less than 1257). Euler's totient φ(1257) = 836 numbers up to 1257 share no factor with it.
- 4
The digits of 1257 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 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1257 = 3 \times 419 \]
1257 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1680 |
| Euler totient φ(n) | 836 |
| Square | 1580049 |
| Cube | 1986121593 |
| Square root | 35.454196 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 39 |
| Scientific notation | 1.257 × |
1257 in other forms
| Form | Value |
|---|---|
| In words | one thousand two hundred and fifty-seven |
| Roman numerals | MCCLVII |
| Binary (base 2) | 10011101001 |
| Octal (base 8) | 2351 |
| Hexadecimal (base 16) | 4E9 |
| Base 3 | 1201120 |
| As time | 1257 seconds = 20 min 57 s |
Is 1257 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 (1257 ÷ 3 = 419) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 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 1) | 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 7) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1257 a prime number?
No. 1257 = 3 × 419, so it is divisible by 3.
What are the factors of 1257?
1, 3, 419, 1257.
What is 1257 in binary?
10011101001 (hexadecimal 4E9, octal 2351).
What is the square root of 1257?
About 35.4542.
What is 1257 in Roman numerals?
MCCLVII.
Is 1257 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 1257?
1257 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 419, the product of two primes.