The number 55972
55972 is a composite number with 12 divisors. Its prime factorisation is × 7 × 1999. Divisors (12): 1, 2, 4, 7, 14, 28, 1999, 3998, 7996, 13993, 27986, 55972.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55972: a Harshad number: divisible by its digit sum 28.
- 2
55972 is composite. Its prime factorisation is
- 3
The divisors add up to 112000; without 55972 itself that is 56028, so 55972 is abundant (56028 is more than 55972). Euler's totient φ(55972) = 23976 numbers up to 55972 share no factor with it.
- 4
The digits of 55972 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55972 = 2^{2} \times 7 \times 1999 \]55972 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 112000 |
| Euler totient φ(n) | 23976 |
| Square | 3132864784 |
| Cube | 175352707690048 |
| Square root | 236.584023 (= 2√13993) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.5972 × |
55972 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and seventy-two |
| Binary (base 2) | 1101101010100100 |
| Octal (base 8) | 155244 |
| Hexadecimal (base 16) | DAA4 |
| Base 3 | 2211210001 |
| As time | 55972 seconds = 15 h 32 min 52 s |
Is 55972 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55972 ÷ 2 = 27986) | 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 (55972 ÷ 4 = 13993) | 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 | Yes (55972 ÷ 7 = 7996) | 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 1) | 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 4) | 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 55972 a prime number?
No. 55972 = × 7 × 1999, so it is divisible by 2.
What are the factors of 55972?
1, 2, 4, 7, 14, 28, 1999, 3998, 7996, 13993, 27986, 55972.
What is 55972 in binary?
1101101010100100 (hexadecimal DAA4, octal 155244).
What is the square root of 55972?
About 236.5840, exactly 2√13993.
Is 55972 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 55972?
55972 is a Harshad number: divisible by its digit sum 28.