The number 15395
15395 is a composite number with 4 divisors. Its prime factorisation is 5 × 3079. Divisors (4): 1, 5, 3079, 15395.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15395: a semiprime: 5 × 3079, the product of two primes.
- 2
15395 is composite. Its prime factorisation is
- 3
The divisors add up to 18480; without 15395 itself that is 3085, so 15395 is deficient (3085 is less than 15395). Euler's totient φ(15395) = 12312 numbers up to 15395 share no factor with it.
- 4
The digits of 15395 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15395 = 5 \times 3079 \]
15395 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 18480 |
| Euler totient φ(n) | 12312 |
| Square | 237006025 |
| Cube | 3648707754875 |
| Square root | 124.076589 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 53 |
| Scientific notation | 1.5395 × |
15395 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand three hundred and ninety-five |
| Binary (base 2) | 11110000100011 |
| Octal (base 8) | 36043 |
| Hexadecimal (base 16) | 3C23 |
| Base 3 | 210010012 |
| As time | 15395 seconds = 4 h 16 min 35 s |
Is 15395 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 2) | 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 (15395 ÷ 5 = 3079) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 5) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15395 a prime number?
No. 15395 = 5 × 3079, so it is divisible by 5.
What are the factors of 15395?
1, 5, 3079, 15395.
What is 15395 in binary?
11110000100011 (hexadecimal 3C23, octal 36043).
What is the square root of 15395?
About 124.0766.
Is 15395 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 15395?
15395 is a semiprime: 5 × 3079, the product of two primes.