The number 13465
13465 is a composite number with 4 divisors. Its prime factorisation is 5 × 2693. Divisors (4): 1, 5, 2693, 13465.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13465: a semiprime: 5 × 2693, the product of two primes.
- 2
13465 is composite. Its prime factorisation is
- 3
The divisors add up to 16164; without 13465 itself that is 2699, so 13465 is deficient (2699 is less than 13465). Euler's totient φ(13465) = 10768 numbers up to 13465 share no factor with it.
- 4
The digits of 13465 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13465 = 5 \times 2693 \]
13465 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16164 |
| Euler totient φ(n) | 10768 |
| Square | 181306225 |
| Cube | 2441288319625 |
| Square root | 116.038787 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.3465 × |
13465 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand four hundred and sixty-five |
| Binary (base 2) | 11010010011001 |
| Octal (base 8) | 32231 |
| Hexadecimal (base 16) | 3499 |
| Base 3 | 200110201 |
| As time | 13465 seconds = 3 h 44 min 25 s |
Is 13465 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 | Yes (13465 ÷ 5 = 2693) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 13465 a prime number?
No. 13465 = 5 × 2693, so it is divisible by 5.
What are the factors of 13465?
1, 5, 2693, 13465.
What is 13465 in binary?
11010010011001 (hexadecimal 3499, octal 32231).
What is the square root of 13465?
About 116.0388.
Is 13465 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 13465?
13465 is a semiprime: 5 × 2693, the product of two primes.