The number 4962
4962 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 827. Divisors (8): 1, 2, 3, 6, 827, 1654, 2481, 4962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
4962 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
4962 is composite. Its prime factorisation is
- 3
The divisors add up to 9936; without 4962 itself that is 4974, so 4962 is abundant (4974 is more than 4962). Euler's totient φ(4962) = 1652 numbers up to 4962 share no factor with it.
- 4
The digits of 4962 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 41 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4962 = 2 \times 3 \times 827 \]
4962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 9936 |
| Euler totient φ(n) | 1652 |
| Square | 24621444 |
| Cube | 122171605128 |
| Square root | 70.441465 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 41 |
| Scientific notation | 4.962 × |
4962 in other forms
| Form | Value |
|---|---|
| In words | four thousand nine hundred and sixty-two |
| Binary (base 2) | 1001101100010 |
| Octal (base 8) | 11542 |
| Hexadecimal (base 16) | 1362 |
| Base 3 | 20210210 |
| As time | 4962 seconds = 1 h 22 min 42 s |
Is 4962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (4962 ÷ 2 = 2481) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (4962 ÷ 3 = 1654) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 (4962 ÷ 6 = 827) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 2) | 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 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 4962 a prime number?
No. 4962 = 2 × 3 × 827, so it is divisible by 2.
What are the factors of 4962?
1, 2, 3, 6, 827, 1654, 2481, 4962.
What is 4962 in binary?
1001101100010 (hexadecimal 1362, octal 11542).
What is the square root of 4962?
About 70.4415.
Is 4962 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 4962?
It is a composite number with 8 divisors.