The number 15195
15195 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 1013. Divisors (8): 1, 3, 5, 15, 1013, 3039, 5065, 15195.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15195: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
15195 is composite. Its prime factorisation is
- 3
The divisors add up to 24336; without 15195 itself that is 9141, so 15195 is deficient (9141 is less than 15195). Euler's totient φ(15195) = 8096 numbers up to 15195 share no factor with it.
- 4
The digits of 15195 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 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15195 = 3 \times 5 \times 1013 \]
15195 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 24336 |
| Euler totient φ(n) | 8096 |
| Square | 230888025 |
| Cube | 3508343539875 |
| Square root | 123.268001 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.5195 × |
15195 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and ninety-five |
| Binary (base 2) | 11101101011011 |
| Octal (base 8) | 35533 |
| Hexadecimal (base 16) | 3B5B |
| Base 3 | 202211210 |
| As time | 15195 seconds = 4 h 13 min 15 s |
Is 15195 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 (15195 ÷ 3 = 5065) | 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 (15195 ÷ 5 = 3039) | 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 5) | 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 4) | 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 15195 a prime number?
No. 15195 = 3 × 5 × 1013, so it is divisible by 3.
What are the factors of 15195?
1, 3, 5, 15, 1013, 3039, 5065, 15195.
What is 15195 in binary?
11101101011011 (hexadecimal 3B5B, octal 35533).
What is the square root of 15195?
About 123.2680.
Is 15195 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 15195?
15195 is a happy number: repeatedly adding the squares of its digits reaches 1.