The number 15485
15485 is a composite number with 8 divisors. Its prime factorisation is 5 × 19 × 163. Divisors (8): 1, 5, 19, 95, 163, 815, 3097, 15485.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15485 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15485 is composite. Its prime factorisation is
- 3
The divisors add up to 19680; without 15485 itself that is 4195, so 15485 is deficient (4195 is less than 15485). Euler's totient φ(15485) = 11664 numbers up to 15485 share no factor with it.
- 4
The digits of 15485 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 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15485 = 5 \times 19 \times 163 \]
15485 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 19680 |
| Euler totient φ(n) | 11664 |
| Square | 239785225 |
| Cube | 3713074209125 |
| Square root | 124.438740 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 115 |
| Scientific notation | 1.5485 × |
15485 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand four hundred and eighty-five |
| Binary (base 2) | 11110001111101 |
| Octal (base 8) | 36175 |
| Hexadecimal (base 16) | 3C7D |
| Base 3 | 210020112 |
| As time | 15485 seconds = 4 h 18 min 5 s |
Is 15485 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (15485 ÷ 5 = 3097) | 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 1) | 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 5) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15485 a prime number?
No. 15485 = 5 × 19 × 163, so it is divisible by 5.
What are the factors of 15485?
1, 5, 19, 95, 163, 815, 3097, 15485.
What is 15485 in binary?
11110001111101 (hexadecimal 3C7D, octal 36175).
What is the square root of 15485?
About 124.4387.
Is 15485 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 15485?
It is a composite number with 8 divisors.