The number 1456
1456 is a composite number with 20 divisors. Its prime factorisation is × 7 × 13. Divisors (20): 1, 2, 4, 7, 8, 13, 14, 16, 26, 28, 52, 56, 91, 104, 112, 182 … 1456.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1456: a Harshad number: divisible by its digit sum 16.
- 2
1456 is composite. Its prime factorisation is
- 3
The divisors add up to 3472; without 1456 itself that is 2016, so 1456 is abundant (2016 is more than 1456). Euler's totient φ(1456) = 576 numbers up to 1456 share no factor with it.
- 4
The digits of 1456 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1456 = 2^{4} \times 7 \times 13 \]1456 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 3472 |
| Euler totient φ(n) | 576 |
| Square | 2119936 |
| Cube | 3086626816 |
| Square root | 38.157568 (= 4√91) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 96 |
| Scientific notation | 1.456 × |
1456 in other forms
| Form | Value |
|---|---|
| In words | one thousand four hundred and fifty-six |
| Roman numerals | MCDLVI |
| Binary (base 2) | 10110110000 |
| Octal (base 8) | 2660 |
| Hexadecimal (base 16) | 5B0 |
| Base 3 | 1222221 |
| As time | 1456 seconds = 24 min 16 s |
Is 1456 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1456 ÷ 2 = 728) | 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 | Yes (1456 ÷ 4 = 364) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 | Yes (1456 ÷ 7 = 208) | 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 | Yes (1456 ÷ 8 = 182) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1456 a prime number?
No. 1456 = × 7 × 13, so it is divisible by 2.
What are the factors of 1456?
1, 2, 4, 7, 8, 13, 14, 16, 26, 28, 52, 56, 91, 104, 112, 182, 208, 364, 728, 1456.
What is 1456 in binary?
10110110000 (hexadecimal 5B0, octal 2660).
What is the square root of 1456?
About 38.1576, exactly 4√91.
What is 1456 in Roman numerals?
MCDLVI.
Is 1456 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 1456?
1456 is a Harshad number: divisible by its digit sum 16.