The number 12485
12485 is a composite number with 8 divisors. Its prime factorisation is 5 × 11 × 227. Divisors (8): 1, 5, 11, 55, 227, 1135, 2497, 12485.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12485 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12485 is composite. Its prime factorisation is
- 3
The divisors add up to 16416; without 12485 itself that is 3931, so 12485 is deficient (3931 is less than 12485). Euler's totient φ(12485) = 9040 numbers up to 12485 share no factor with it.
- 4
The digits of 12485 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12485 = 5 \times 11 \times 227 \]
12485 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 16416 |
| Euler totient φ(n) | 9040 |
| Square | 155875225 |
| Cube | 1946102184125 |
| Square root | 111.736297 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 63 |
| Scientific notation | 1.2485 × |
12485 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand four hundred and eighty-five |
| Binary (base 2) | 11000011000101 |
| Octal (base 8) | 30305 |
| Hexadecimal (base 16) | 30C5 |
| Base 3 | 122010102 |
| As time | 12485 seconds = 3 h 28 min 5 s |
Is 12485 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 (12485 ÷ 5 = 2497) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 | Yes (12485 ÷ 11 = 1135) | 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 12485 a prime number?
No. 12485 = 5 × 11 × 227, so it is divisible by 5.
What are the factors of 12485?
1, 5, 11, 55, 227, 1135, 2497, 12485.
What is 12485 in binary?
11000011000101 (hexadecimal 30C5, octal 30305).
What is the square root of 12485?
About 111.7363.
Is 12485 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 12485?
It is a composite number with 8 divisors.