The number 13598
13598 is a composite number with 8 divisors. Its prime factorisation is 2 × 13 × 523. Divisors (8): 1, 2, 13, 26, 523, 1046, 6799, 13598.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13598: a Harshad number: divisible by its digit sum 26.
- 2
13598 is composite. Its prime factorisation is
- 3
The divisors add up to 22008; without 13598 itself that is 8410, so 13598 is deficient (8410 is less than 13598). Euler's totient φ(13598) = 6264 numbers up to 13598 share no factor with it.
- 4
The digits of 13598 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 120 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13598 = 2 \times 13 \times 523 \]
13598 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 22008 |
| Euler totient φ(n) | 6264 |
| Square | 184905604 |
| Cube | 2514346403192 |
| Square root | 116.610463 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 120 |
| Scientific notation | 1.3598 × |
13598 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand five hundred and ninety-eight |
| Binary (base 2) | 11010100011110 |
| Octal (base 8) | 32436 |
| Hexadecimal (base 16) | 351E |
| Base 3 | 200122122 |
| As time | 13598 seconds = 3 h 46 min 38 s |
Is 13598 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13598 ÷ 2 = 6799) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 | No (remainder 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13598 a prime number?
No. 13598 = 2 × 13 × 523, so it is divisible by 2.
What are the factors of 13598?
1, 2, 13, 26, 523, 1046, 6799, 13598.
What is 13598 in binary?
11010100011110 (hexadecimal 351E, octal 32436).
What is the square root of 13598?
About 116.6105.
Is 13598 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 13598?
13598 is a Harshad number: divisible by its digit sum 26.