The number 13592
13592 is a composite number with 8 divisors. Its prime factorisation is × 1699. Divisors (8): 1, 2, 4, 8, 1699, 3398, 6796, 13592.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
13592 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
13592 is composite. Its prime factorisation is
- 3
The divisors add up to 25500; without 13592 itself that is 11908, so 13592 is deficient (11908 is less than 13592). Euler's totient φ(13592) = 6792 numbers up to 13592 share no factor with it.
- 4
The digits of 13592 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13592 = 2^{3} \times 1699 \]13592 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 25500 |
| Euler totient φ(n) | 6792 |
| Square | 184742464 |
| Cube | 2511019570688 |
| Square root | 116.584733 (= 2√3398) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 63 |
| Scientific notation | 1.3592 × |
13592 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand five hundred and ninety-two |
| Binary (base 2) | 11010100011000 |
| Octal (base 8) | 32430 |
| Hexadecimal (base 16) | 3518 |
| Base 3 | 200122102 |
| As time | 13592 seconds = 3 h 46 min 32 s |
Is 13592 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13592 ÷ 2 = 6796) | 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 (13592 ÷ 4 = 3398) | 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 5) | 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 (13592 ÷ 8 = 1699) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 7) | 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 13592 a prime number?
No. 13592 = × 1699, so it is divisible by 2.
What are the factors of 13592?
1, 2, 4, 8, 1699, 3398, 6796, 13592.
What is 13592 in binary?
11010100011000 (hexadecimal 3518, octal 32430).
What is the square root of 13592?
About 116.5847, exactly 2√3398.
Is 13592 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 13592?
It is a composite number with 8 divisors.