The number 13495
13495 is a composite number with 4 divisors. Its prime factorisation is 5 × 2699. Divisors (4): 1, 5, 2699, 13495.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13495: a semiprime: 5 × 2699, the product of two primes.
- 2
13495 is composite. Its prime factorisation is
- 3
The divisors add up to 16200; without 13495 itself that is 2705, so 13495 is deficient (2705 is less than 13495). Euler's totient φ(13495) = 10792 numbers up to 13495 share no factor with it.
- 4
The digits of 13495 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 182 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13495 = 5 \times 2699 \]
13495 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16200 |
| Euler totient φ(n) | 10792 |
| Square | 182115025 |
| Cube | 2457642262375 |
| Square root | 116.167982 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 182 |
| Scientific notation | 1.3495 × |
13495 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand four hundred and ninety-five |
| Binary (base 2) | 11010010110111 |
| Octal (base 8) | 32267 |
| Hexadecimal (base 16) | 34B7 |
| Base 3 | 200111211 |
| As time | 13495 seconds = 3 h 44 min 55 s |
Is 13495 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (13495 ÷ 5 = 2699) | 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 7) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13495 a prime number?
No. 13495 = 5 × 2699, so it is divisible by 5.
What are the factors of 13495?
1, 5, 2699, 13495.
What is 13495 in binary?
11010010110111 (hexadecimal 34B7, octal 32267).
What is the square root of 13495?
About 116.1680.
Is 13495 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 13495?
13495 is a semiprime: 5 × 2699, the product of two primes.