The number 12495
12495 is a composite number with 24 divisors. Its prime factorisation is 3 × 5 × × 17. Divisors (24): 1, 3, 5, 7, 15, 17, 21, 35, 49, 51, 85, 105, 119, 147, 245, 255 … 12495.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12495: a Harshad number: divisible by its digit sum 21.
- 2
12495 is composite. Its prime factorisation is
- 3
The divisors add up to 24624; without 12495 itself that is 12129, so 12495 is deficient (12129 is less than 12495). Euler's totient φ(12495) = 5376 numbers up to 12495 share no factor with it.
- 4
The digits of 12495 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 187 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12495 = 3 \times 5 \times 7^{2} \times 17 \]12495 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 24624 |
| Euler totient φ(n) | 5376 |
| Square | 156125025 |
| Cube | 1950782187375 |
| Square root | 111.781036 (= 7√255) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 187 |
| Scientific notation | 1.2495 × |
12495 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand four hundred and ninety-five |
| Binary (base 2) | 11000011001111 |
| Octal (base 8) | 30317 |
| Hexadecimal (base 16) | 30CF |
| Base 3 | 122010210 |
| As time | 12495 seconds = 3 h 28 min 15 s |
Is 12495 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 (12495 ÷ 3 = 4165) | 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 (12495 ÷ 5 = 2499) | 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 | Yes (12495 ÷ 7 = 1785) | 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 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 10) | 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 12495 a prime number?
No. 12495 = 3 × 5 × × 17, so it is divisible by 3.
What are the factors of 12495?
1, 3, 5, 7, 15, 17, 21, 35, 49, 51, 85, 105, 119, 147, 245, 255, 357, 595, 735, 833, 1785, 2499, 4165, 12495.
What is 12495 in binary?
11000011001111 (hexadecimal 30CF, octal 30317).
What is the square root of 12495?
About 111.7810, exactly 7√255.
Is 12495 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 12495?
12495 is a Harshad number: divisible by its digit sum 21.