The number 13369
13369 is a composite number with 4 divisors. Its prime factorisation is 29 × 461. Divisors (4): 1, 29, 461, 13369.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13369: a semiprime: 29 × 461, the product of two primes.
- 2
13369 is composite. Its prime factorisation is
- 3
The divisors add up to 13860; without 13369 itself that is 491, so 13369 is deficient (491 is less than 13369). Euler's totient φ(13369) = 12880 numbers up to 13369 share no factor with it.
- 4
The digits of 13369 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 94 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13369 = 29 \times 461 \]
13369 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 13860 |
| Euler totient φ(n) | 12880 |
| Square | 178730161 |
| Cube | 2389443522409 |
| Square root | 115.624392 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 94 |
| Scientific notation | 1.3369 × |
13369 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand three hundred and sixty-nine |
| Binary (base 2) | 11010000111001 |
| Octal (base 8) | 32071 |
| Hexadecimal (base 16) | 3439 |
| Base 3 | 200100011 |
| As time | 13369 seconds = 3 h 42 min 49 s |
Is 13369 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 | No (remainder 1) | 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 1) | 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 | No (remainder 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13369 a prime number?
No. 13369 = 29 × 461, so it is divisible by 29.
What are the factors of 13369?
1, 29, 461, 13369.
What is 13369 in binary?
11010000111001 (hexadecimal 3439, octal 32071).
What is the square root of 13369?
About 115.6244.
Is 13369 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 13369?
13369 is a semiprime: 29 × 461, the product of two primes.