The number 55472
55472 is a composite number with 10 divisors. Its prime factorisation is × 3467. Divisors (10): 1, 2, 4, 8, 16, 3467, 6934, 13868, 27736, 55472.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55472 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55472 is composite. Its prime factorisation is
- 3
The divisors add up to 107508; without 55472 itself that is 52036, so 55472 is deficient (52036 is less than 55472). Euler's totient φ(55472) = 27728 numbers up to 55472 share no factor with it.
- 4
The digits of 55472 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55472 = 2^{4} \times 3467 \]55472 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 107508 |
| Euler totient φ(n) | 27728 |
| Square | 3077142784 |
| Cube | 170695264514048 |
| Square root | 235.524946 (= 4√3467) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.5472 × |
55472 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand four hundred and seventy-two |
| Binary (base 2) | 1101100010110000 |
| Octal (base 8) | 154260 |
| Hexadecimal (base 16) | D8B0 |
| Base 3 | 2211002112 |
| As time | 55472 seconds = 15 h 24 min 32 s |
Is 55472 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55472 ÷ 2 = 27736) | 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 (55472 ÷ 4 = 13868) | 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 4) | 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 (55472 ÷ 8 = 6934) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55472 a prime number?
No. 55472 = × 3467, so it is divisible by 2.
What are the factors of 55472?
1, 2, 4, 8, 16, 3467, 6934, 13868, 27736, 55472.
What is 55472 in binary?
1101100010110000 (hexadecimal D8B0, octal 154260).
What is the square root of 55472?
About 235.5249, exactly 4√3467.
Is 55472 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 55472?
It is a composite number with 10 divisors.