The number 12507
12507 is a composite number with 8 divisors. Its prime factorisation is 3 × 11 × 379. Divisors (8): 1, 3, 11, 33, 379, 1137, 4169, 12507.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12507: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
12507 is composite. Its prime factorisation is
- 3
The divisors add up to 18240; without 12507 itself that is 5733, so 12507 is deficient (5733 is less than 12507). Euler's totient φ(12507) = 7560 numbers up to 12507 share no factor with it.
- 4
The digits of 12507 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 112 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12507 = 3 \times 11 \times 379 \]
12507 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 18240 |
| Euler totient φ(n) | 7560 |
| Square | 156425049 |
| Cube | 1956408087843 |
| Square root | 111.834699 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 112 |
| Scientific notation | 1.2507 × |
12507 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand five hundred and seven |
| Binary (base 2) | 11000011011011 |
| Octal (base 8) | 30333 |
| Hexadecimal (base 16) | 30DB |
| Base 3 | 122011020 |
| As time | 12507 seconds = 3 h 28 min 27 s |
Is 12507 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 (12507 ÷ 3 = 4169) | 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 | No (remainder 2) | 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 5) | 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 3) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (12507 ÷ 11 = 1137) | 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 12507 a prime number?
No. 12507 = 3 × 11 × 379, so it is divisible by 3.
What are the factors of 12507?
1, 3, 11, 33, 379, 1137, 4169, 12507.
What is 12507 in binary?
11000011011011 (hexadecimal 30DB, octal 30333).
What is the square root of 12507?
About 111.8347.
Is 12507 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 12507?
12507 is a happy number: repeatedly adding the squares of its digits reaches 1.