The number 12555
12555 is a composite number with 20 divisors. Its prime factorisation is × 5 × 31. Divisors (20): 1, 3, 5, 9, 15, 27, 31, 45, 81, 93, 135, 155, 279, 405, 465, 837 … 12555.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12555 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12555 is composite. Its prime factorisation is
- 3
The divisors add up to 23232; without 12555 itself that is 10677, so 12555 is deficient (10677 is less than 12555). Euler's totient φ(12555) = 6480 numbers up to 12555 share no factor with it.
- 4
The digits of 12555 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 107 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12555 = 3^{4} \times 5 \times 31 \]12555 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 23232 |
| Euler totient φ(n) | 6480 |
| Square | 157628025 |
| Cube | 1979019853875 |
| Square root | 112.049096 (= 9√155) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 107 |
| Scientific notation | 1.2555 × |
12555 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand five hundred and fifty-five |
| Binary (base 2) | 11000100001011 |
| Octal (base 8) | 30413 |
| Hexadecimal (base 16) | 310B |
| Base 3 | 122020000 |
| As time | 12555 seconds = 3 h 29 min 15 s |
Is 12555 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 (12555 ÷ 3 = 4185) | 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 (12555 ÷ 5 = 2511) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (12555 ÷ 9 = 1395) | 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 4) | 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 12555 a prime number?
No. 12555 = × 5 × 31, so it is divisible by 3.
What are the factors of 12555?
1, 3, 5, 9, 15, 27, 31, 45, 81, 93, 135, 155, 279, 405, 465, 837, 1395, 2511, 4185, 12555.
What is 12555 in binary?
11000100001011 (hexadecimal 310B, octal 30413).
What is the square root of 12555?
About 112.0491, exactly 9√155.
Is 12555 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 12555?
It is a composite number with 20 divisors.