The number 12504
12504 is a composite number with 16 divisors. Its prime factorisation is × 3 × 521. Divisors (16): 1, 2, 3, 4, 6, 8, 12, 24, 521, 1042, 1563, 2084, 3126, 4168, 6252, 12504.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12504: a Harshad number: divisible by its digit sum 12.
- 2
12504 is composite. Its prime factorisation is
- 3
The divisors add up to 31320; without 12504 itself that is 18816, so 12504 is abundant (18816 is more than 12504). Euler's totient φ(12504) = 4160 numbers up to 12504 share no factor with it.
- 4
The digits of 12504 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 156 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12504 = 2^{3} \times 3 \times 521 \]12504 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 31320 |
| Euler totient φ(n) | 4160 |
| Square | 156350016 |
| Cube | 1955000600064 |
| Square root | 111.821286 (= 2√3126) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 156 |
| Scientific notation | 1.2504 × |
12504 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand five hundred and four |
| Binary (base 2) | 11000011011000 |
| Octal (base 8) | 30330 |
| Hexadecimal (base 16) | 30D8 |
| Base 3 | 122011010 |
| As time | 12504 seconds = 3 h 28 min 24 s |
Is 12504 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12504 ÷ 2 = 6252) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (12504 ÷ 3 = 4168) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (12504 ÷ 4 = 3126) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (12504 ÷ 6 = 2084) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 | Yes (12504 ÷ 8 = 1563) | 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 4) | 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 | Yes (12504 ÷ 12 = 1042) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12504 a prime number?
No. 12504 = × 3 × 521, so it is divisible by 2.
What are the factors of 12504?
1, 2, 3, 4, 6, 8, 12, 24, 521, 1042, 1563, 2084, 3126, 4168, 6252, 12504.
What is 12504 in binary?
11000011011000 (hexadecimal 30D8, octal 30330).
What is the square root of 12504?
About 111.8213, exactly 2√3126.
Is 12504 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 12504?
12504 is a Harshad number: divisible by its digit sum 12.