The number 15495
15495 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 1033. Divisors (8): 1, 3, 5, 15, 1033, 3099, 5165, 15495.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15495 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15495 is composite. Its prime factorisation is
- 3
The divisors add up to 24816; without 15495 itself that is 9321, so 15495 is deficient (9321 is less than 15495). Euler's totient φ(15495) = 8256 numbers up to 15495 share no factor with it.
- 4
The digits of 15495 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15495 = 3 \times 5 \times 1033 \]
15495 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 24816 |
| Euler totient φ(n) | 8256 |
| Square | 240095025 |
| Cube | 3720272412375 |
| Square root | 124.478914 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 115 |
| Scientific notation | 1.5495 × |
15495 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand four hundred and ninety-five |
| Binary (base 2) | 11110010000111 |
| Octal (base 8) | 36207 |
| Hexadecimal (base 16) | 3C87 |
| Base 3 | 210020220 |
| As time | 15495 seconds = 4 h 18 min 15 s |
Is 15495 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 (15495 ÷ 3 = 5165) | 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 (15495 ÷ 5 = 3099) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 7) | 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 15495 a prime number?
No. 15495 = 3 × 5 × 1033, so it is divisible by 3.
What are the factors of 15495?
1, 3, 5, 15, 1033, 3099, 5165, 15495.
What is 15495 in binary?
11110010000111 (hexadecimal 3C87, octal 36207).
What is the square root of 15495?
About 124.4789.
Is 15495 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 15495?
It is a composite number with 8 divisors.