The number 5592
5592 is a composite number with 16 divisors. Its prime factorisation is × 3 × 233. Divisors (16): 1, 2, 3, 4, 6, 8, 12, 24, 233, 466, 699, 932, 1398, 1864, 2796, 5592.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5592 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5592 is composite. Its prime factorisation is
- 3
The divisors add up to 14040; without 5592 itself that is 8448, so 5592 is abundant (8448 is more than 5592). Euler's totient φ(5592) = 1856 numbers up to 5592 share no factor with it.
- 4
The digits of 5592 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 67 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5592 = 2^{3} \times 3 \times 233 \]5592 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 14040 |
| Euler totient φ(n) | 1856 |
| Square | 31270464 |
| Cube | 174864434688 |
| Square root | 74.779676 (= 2√1398) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 67 |
| Scientific notation | 5.592 × |
5592 in other forms
| Form | Value |
|---|---|
| In words | five thousand five hundred and ninety-two |
| Binary (base 2) | 1010111011000 |
| Octal (base 8) | 12730 |
| Hexadecimal (base 16) | 15D8 |
| Base 3 | 21200010 |
| As time | 5592 seconds = 1 h 33 min 12 s |
Is 5592 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5592 ÷ 2 = 2796) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (5592 ÷ 3 = 1864) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (5592 ÷ 4 = 1398) | 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 (5592 ÷ 6 = 932) | 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 | Yes (5592 ÷ 8 = 699) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (5592 ÷ 12 = 466) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5592 a prime number?
No. 5592 = × 3 × 233, so it is divisible by 2.
What are the factors of 5592?
1, 2, 3, 4, 6, 8, 12, 24, 233, 466, 699, 932, 1398, 1864, 2796, 5592.
What is 5592 in binary?
1010111011000 (hexadecimal 15D8, octal 12730).
What is the square root of 5592?
About 74.7797, exactly 2√1398.
Is 5592 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 5592?
It is a composite number with 16 divisors.