The number 13569
13569 is a composite number with 4 divisors. Its prime factorisation is 3 × 4523. Divisors (4): 1, 3, 4523, 13569.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13569: a semiprime: 3 × 4523, the product of two primes.
- 2
13569 is composite. Its prime factorisation is
- 3
The divisors add up to 18096; without 13569 itself that is 4527, so 13569 is deficient (4527 is less than 13569). Euler's totient φ(13569) = 9044 numbers up to 13569 share no factor with it.
- 4
The digits of 13569 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 37 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13569 = 3 \times 4523 \]
13569 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 18096 |
| Euler totient φ(n) | 9044 |
| Square | 184117761 |
| Cube | 2498293899009 |
| Square root | 116.486051 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 37 |
| Scientific notation | 1.3569 × |
13569 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand five hundred and sixty-nine |
| Binary (base 2) | 11010100000001 |
| Octal (base 8) | 32401 |
| Hexadecimal (base 16) | 3501 |
| Base 3 | 200121120 |
| As time | 13569 seconds = 3 h 46 min 9 s |
Is 13569 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (13569 ÷ 3 = 4523) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13569 a prime number?
No. 13569 = 3 × 4523, so it is divisible by 3.
What are the factors of 13569?
1, 3, 4523, 13569.
What is 13569 in binary?
11010100000001 (hexadecimal 3501, octal 32401).
What is the square root of 13569?
About 116.4861.
Is 13569 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 13569?
13569 is a semiprime: 3 × 4523, the product of two primes.