The number 13395
13395 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 19 × 47. Divisors (16): 1, 3, 5, 15, 19, 47, 57, 95, 141, 235, 285, 705, 893, 2679, 4465, 13395.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
13395 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
13395 is composite. Its prime factorisation is
- 3
The divisors add up to 23040; without 13395 itself that is 9645, so 13395 is deficient (9645 is less than 13395). Euler's totient φ(13395) = 6624 numbers up to 13395 share no factor with it.
- 4
The digits of 13395 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 94 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13395 = 3 \times 5 \times 19 \times 47 \]
13395 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 23040 |
| Euler totient φ(n) | 6624 |
| Square | 179426025 |
| Cube | 2403411604875 |
| Square root | 115.736770 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 94 |
| Scientific notation | 1.3395 × |
13395 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand three hundred and ninety-five |
| Binary (base 2) | 11010001010011 |
| Octal (base 8) | 32123 |
| Hexadecimal (base 16) | 3453 |
| Base 3 | 200101010 |
| As time | 13395 seconds = 3 h 43 min 15 s |
Is 13395 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 (13395 ÷ 3 = 4465) | 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 (13395 ÷ 5 = 2679) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13395 a prime number?
No. 13395 = 3 × 5 × 19 × 47, so it is divisible by 3.
What are the factors of 13395?
1, 3, 5, 15, 19, 47, 57, 95, 141, 235, 285, 705, 893, 2679, 4465, 13395.
What is 13395 in binary?
11010001010011 (hexadecimal 3453, octal 32123).
What is the square root of 13395?
About 115.7368.
Is 13395 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 13395?
It is a composite number with 16 divisors.