The number 4152
4152 is a composite number with 16 divisors. Its prime factorisation is × 3 × 173. Divisors (16): 1, 2, 3, 4, 6, 8, 12, 24, 173, 346, 519, 692, 1038, 1384, 2076, 4152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4152: a Harshad number: divisible by its digit sum 12.
- 2
4152 is composite. Its prime factorisation is
- 3
The divisors add up to 10440; without 4152 itself that is 6288, so 4152 is abundant (6288 is more than 4152). Euler's totient φ(4152) = 1376 numbers up to 4152 share no factor with it.
- 4
The digits of 4152 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 64 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4152 = 2^{3} \times 3 \times 173 \]4152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 10440 |
| Euler totient φ(n) | 1376 |
| Square | 17239104 |
| Cube | 71576759808 |
| Square root | 64.436015 (= 2√1038) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 64 |
| Scientific notation | 4.152 × |
4152 in other forms
| Form | Value |
|---|---|
| In words | four thousand one hundred and fifty-two |
| Binary (base 2) | 1000000111000 |
| Octal (base 8) | 10070 |
| Hexadecimal (base 16) | 1038 |
| Base 3 | 12200210 |
| As time | 4152 seconds = 1 h 9 min 12 s |
Is 4152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (4152 ÷ 2 = 2076) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (4152 ÷ 3 = 1384) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (4152 ÷ 4 = 1038) | 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 (4152 ÷ 6 = 692) | 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 | Yes (4152 ÷ 8 = 519) | 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 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (4152 ÷ 12 = 346) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 4152 a prime number?
No. 4152 = × 3 × 173, so it is divisible by 2.
What are the factors of 4152?
1, 2, 3, 4, 6, 8, 12, 24, 173, 346, 519, 692, 1038, 1384, 2076, 4152.
What is 4152 in binary?
1000000111000 (hexadecimal 1038, octal 10070).
What is the square root of 4152?
About 64.4360, exactly 2√1038.
Is 4152 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 4152?
4152 is a Harshad number: divisible by its digit sum 12.