The number 4972
4972 is a composite number with 12 divisors. Its prime factorisation is × 11 × 113. Divisors (12): 1, 2, 4, 11, 22, 44, 113, 226, 452, 1243, 2486, 4972.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4972: a Harshad number: divisible by its digit sum 22.
- 2
4972 is composite. Its prime factorisation is
- 3
The divisors add up to 9576; without 4972 itself that is 4604, so 4972 is deficient (4604 is less than 4972). Euler's totient φ(4972) = 2240 numbers up to 4972 share no factor with it.
- 4
The digits of 4972 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 72 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4972 = 2^{2} \times 11 \times 113 \]4972 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 9576 |
| Euler totient φ(n) | 2240 |
| Square | 24720784 |
| Cube | 122911738048 |
| Square root | 70.512410 (= 2√1243) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 72 |
| Scientific notation | 4.972 × |
4972 in other forms
| Form | Value |
|---|---|
| In words | four thousand nine hundred and seventy-two |
| Binary (base 2) | 1001101101100 |
| Octal (base 8) | 11554 |
| Hexadecimal (base 16) | 136C |
| Base 3 | 20211011 |
| As time | 4972 seconds = 1 h 22 min 52 s |
Is 4972 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (4972 ÷ 2 = 2486) | 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 (4972 ÷ 4 = 1243) | 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 | 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 | No (remainder 4) | 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 | Yes (4972 ÷ 11 = 452) | 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 4972 a prime number?
No. 4972 = × 11 × 113, so it is divisible by 2.
What are the factors of 4972?
1, 2, 4, 11, 22, 44, 113, 226, 452, 1243, 2486, 4972.
What is 4972 in binary?
1001101101100 (hexadecimal 136C, octal 11554).
What is the square root of 4972?
About 70.5124, exactly 2√1243.
Is 4972 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 4972?
4972 is a Harshad number: divisible by its digit sum 22.