The number 5952
5952 is a composite number with 28 divisors. Its prime factorisation is × 3 × 31. Divisors (28): 1, 2, 3, 4, 6, 8, 12, 16, 24, 31, 32, 48, 62, 64, 93, 96 … 5952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5952 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5952 is composite. Its prime factorisation is
- 3
The divisors add up to 16256; without 5952 itself that is 10304, so 5952 is abundant (10304 is more than 5952). Euler's totient φ(5952) = 1920 numbers up to 5952 share no factor with it.
- 4
The digits of 5952 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 23 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5952 = 2^{6} \times 3 \times 31 \]5952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 28 |
| Sum of divisors | 16256 |
| Euler totient φ(n) | 1920 |
| Square | 35426304 |
| Cube | 210857361408 |
| Square root | 77.149206 (= 8√93) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 23 |
| Scientific notation | 5.952 × |
5952 in other forms
| Form | Value |
|---|---|
| In words | five thousand nine hundred and fifty-two |
| Binary (base 2) | 1011101000000 |
| Octal (base 8) | 13500 |
| Hexadecimal (base 16) | 1740 |
| Base 3 | 22011110 |
| As time | 5952 seconds = 1 h 39 min 12 s |
Is 5952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5952 ÷ 2 = 2976) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (5952 ÷ 3 = 1984) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (5952 ÷ 4 = 1488) | 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 (5952 ÷ 6 = 992) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 (5952 ÷ 8 = 744) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (5952 ÷ 12 = 496) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5952 a prime number?
No. 5952 = × 3 × 31, so it is divisible by 2.
What are the factors of 5952?
1, 2, 3, 4, 6, 8, 12, 16, 24, 31, 32, 48, 62, 64, 93, 96, 124, 186, 192, 248, 372, 496, 744, 992, 1488, 1984, 2976, 5952.
What is 5952 in binary?
1011101000000 (hexadecimal 1740, octal 13500).
What is the square root of 5952?
About 77.1492, exactly 8√93.
Is 5952 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 5952?
It is a composite number with 28 divisors.