The number 4872
4872 is a composite number with 32 divisors. Its prime factorisation is × 3 × 7 × 29. Divisors (32): 1, 2, 3, 4, 6, 7, 8, 12, 14, 21, 24, 28, 29, 42, 56, 58 … 4872.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4872: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 21.
- 2
4872 is composite. Its prime factorisation is
- 3
The divisors add up to 14400; without 4872 itself that is 9528, so 4872 is abundant (9528 is more than 4872). Euler's totient φ(4872) = 1344 numbers up to 4872 share no factor with it.
- 4
The digits of 4872 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 134 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4872 = 2^{3} \times 3 \times 7 \times 29 \]4872 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 14400 |
| Euler totient φ(n) | 1344 |
| Square | 23736384 |
| Cube | 115643662848 |
| Square root | 69.799713 (= 2√1218) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 134 |
| Scientific notation | 4.872 × |
4872 in other forms
| Form | Value |
|---|---|
| In words | four thousand eight hundred and seventy-two |
| Binary (base 2) | 1001100001000 |
| Octal (base 8) | 11410 |
| Hexadecimal (base 16) | 1308 |
| Base 3 | 20200110 |
| As time | 4872 seconds = 1 h 21 min 12 s |
Is 4872 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (4872 ÷ 2 = 2436) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (4872 ÷ 3 = 1624) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (4872 ÷ 4 = 1218) | 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 (4872 ÷ 6 = 812) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (4872 ÷ 7 = 696) | 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 (4872 ÷ 8 = 609) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (4872 ÷ 12 = 406) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 4872 a prime number?
No. 4872 = × 3 × 7 × 29, so it is divisible by 2.
What are the factors of 4872?
1, 2, 3, 4, 6, 7, 8, 12, 14, 21, 24, 28, 29, 42, 56, 58, 84, 87, 116, 168, 174, 203, 232, 348, 406, 609, 696, 812, 1218, 1624, 2436, 4872.
What is 4872 in binary?
1001100001000 (hexadecimal 1308, octal 11410).
What is the square root of 4872?
About 69.7997, exactly 2√1218.
Is 4872 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 4872?
4872 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 21.