The number 4952
4952 is a composite number with 8 divisors. Its prime factorisation is × 619. Divisors (8): 1, 2, 4, 8, 619, 1238, 2476, 4952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
4952 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
4952 is composite. Its prime factorisation is
- 3
The divisors add up to 9300; without 4952 itself that is 4348, so 4952 is deficient (4348 is less than 4952). Euler's totient φ(4952) = 2472 numbers up to 4952 share no factor with it.
- 4
The digits of 4952 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 134 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4952 = 2^{3} \times 619 \]4952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 9300 |
| Euler totient φ(n) | 2472 |
| Square | 24522304 |
| Cube | 121434449408 |
| Square root | 70.370448 (= 2√1238) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 134 |
| Scientific notation | 4.952 × |
4952 in other forms
| Form | Value |
|---|---|
| In words | four thousand nine hundred and fifty-two |
| Binary (base 2) | 1001101011000 |
| Octal (base 8) | 11530 |
| Hexadecimal (base 16) | 1358 |
| Base 3 | 20210102 |
| As time | 4952 seconds = 1 h 22 min 32 s |
Is 4952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (4952 ÷ 2 = 2476) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (4952 ÷ 4 = 1238) | 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 2) | 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 | Yes (4952 ÷ 8 = 619) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 4952 a prime number?
No. 4952 = × 619, so it is divisible by 2.
What are the factors of 4952?
1, 2, 4, 8, 619, 1238, 2476, 4952.
What is 4952 in binary?
1001101011000 (hexadecimal 1358, octal 11530).
What is the square root of 4952?
About 70.3704, exactly 2√1238.
Is 4952 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 4952?
It is a composite number with 8 divisors.