The number 1452
1452 is a composite number with 18 divisors. Its prime factorisation is × 3 × . Divisors (18): 1, 2, 3, 4, 6, 11, 12, 22, 33, 44, 66, 121, 132, 242, 363, 484 … 1452.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1452: a Harshad number: divisible by its digit sum 12.
- 2
1452 is composite. Its prime factorisation is
- 3
The divisors add up to 3724; without 1452 itself that is 2272, so 1452 is abundant (2272 is more than 1452). Euler's totient φ(1452) = 440 numbers up to 1452 share no factor with it.
- 4
The digits of 1452 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1452 = 2^{2} \times 3 \times 11^{2} \]1452 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 3724 |
| Euler totient φ(n) | 440 |
| Square | 2108304 |
| Cube | 3061257408 |
| Square root | 38.105118 (= 22√3) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 47 |
| Scientific notation | 1.452 × |
1452 in other forms
| Form | Value |
|---|---|
| In words | one thousand four hundred and fifty-two |
| Roman numerals | MCDLII |
| Binary (base 2) | 10110101100 |
| Octal (base 8) | 2654 |
| Hexadecimal (base 16) | 5AC |
| Base 3 | 1222210 |
| As time | 1452 seconds = 24 min 12 s |
Is 1452 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1452 ÷ 2 = 726) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (1452 ÷ 3 = 484) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (1452 ÷ 4 = 363) | 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 | Yes (1452 ÷ 6 = 242) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (1452 ÷ 11 = 132) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (1452 ÷ 12 = 121) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1452 a prime number?
No. 1452 = × 3 × , so it is divisible by 2.
What are the factors of 1452?
1, 2, 3, 4, 6, 11, 12, 22, 33, 44, 66, 121, 132, 242, 363, 484, 726, 1452.
What is 1452 in binary?
10110101100 (hexadecimal 5AC, octal 2654).
What is the square root of 1452?
About 38.1051, exactly 22√3.
What is 1452 in Roman numerals?
MCDLII.
Is 1452 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 1452?
1452 is a Harshad number: divisible by its digit sum 12.