The number 12558
12558 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 7 × 13 × 23. Divisors (32): 1, 2, 3, 6, 7, 13, 14, 21, 23, 26, 39, 42, 46, 69, 78, 91 … 12558.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12558: a Harshad number: divisible by its digit sum 21.
- 2
12558 is composite. Its prime factorisation is
- 3
The divisors add up to 32256; without 12558 itself that is 19698, so 12558 is abundant (19698 is more than 12558). Euler's totient φ(12558) = 3168 numbers up to 12558 share no factor with it.
- 4
The digits of 12558 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 107 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12558 = 2 \times 3 \times 7 \times 13 \times 23 \]
12558 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 32256 |
| Euler totient φ(n) | 3168 |
| Square | 157703364 |
| Cube | 1980438845112 |
| Square root | 112.062483 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 107 |
| Scientific notation | 1.2558 × |
12558 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand five hundred and fifty-eight |
| Binary (base 2) | 11000100001110 |
| Octal (base 8) | 30416 |
| Hexadecimal (base 16) | 310E |
| Base 3 | 122020010 |
| As time | 12558 seconds = 3 h 29 min 18 s |
Is 12558 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12558 ÷ 2 = 6279) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (12558 ÷ 3 = 4186) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (12558 ÷ 6 = 2093) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (12558 ÷ 7 = 1794) | 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 6) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12558 a prime number?
No. 12558 = 2 × 3 × 7 × 13 × 23, so it is divisible by 2.
What are the factors of 12558?
1, 2, 3, 6, 7, 13, 14, 21, 23, 26, 39, 42, 46, 69, 78, 91, 138, 161, 182, 273, 299, 322, 483, 546, 598, 897, 966, 1794, 2093, 4186, 6279, 12558.
What is 12558 in binary?
11000100001110 (hexadecimal 310E, octal 30416).
What is the square root of 12558?
About 112.0625.
Is 12558 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 12558?
12558 is a Harshad number: divisible by its digit sum 21.