The number 5152
5152 is a composite number with 24 divisors. Its prime factorisation is × 7 × 23. Divisors (24): 1, 2, 4, 7, 8, 14, 16, 23, 28, 32, 46, 56, 92, 112, 161, 184 … 5152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5152 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5152 is composite. Its prime factorisation is
- 3
The divisors add up to 12096; without 5152 itself that is 6944, so 5152 is abundant (6944 is more than 5152). Euler's totient φ(5152) = 2112 numbers up to 5152 share no factor with it.
- 4
The digits of 5152 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 103 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5152 = 2^{5} \times 7 \times 23 \]5152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 12096 |
| Euler totient φ(n) | 2112 |
| Square | 26543104 |
| Cube | 136750071808 |
| Square root | 71.777434 (= 4√322) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 103 |
| Scientific notation | 5.152 × |
5152 in other forms
| Form | Value |
|---|---|
| In words | five thousand one hundred and fifty-two |
| Binary (base 2) | 1010000100000 |
| Octal (base 8) | 12040 |
| Hexadecimal (base 16) | 1420 |
| Base 3 | 21001211 |
| As time | 5152 seconds = 1 h 25 min 52 s |
Is 5152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5152 ÷ 2 = 2576) | 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 (5152 ÷ 4 = 1288) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (5152 ÷ 7 = 736) | 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 (5152 ÷ 8 = 644) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 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 5152 a prime number?
No. 5152 = × 7 × 23, so it is divisible by 2.
What are the factors of 5152?
1, 2, 4, 7, 8, 14, 16, 23, 28, 32, 46, 56, 92, 112, 161, 184, 224, 322, 368, 644, 736, 1288, 2576, 5152.
What is 5152 in binary?
1010000100000 (hexadecimal 1420, octal 12040).
What is the square root of 5152?
About 71.7774, exactly 4√322.
Is 5152 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 5152?
It is a composite number with 24 divisors.