The number 12483
12483 is a binary palindrome (11000011000011). Its prime factorisation is × 19 × 73. Divisors (12): 1, 3, 9, 19, 57, 73, 171, 219, 657, 1387, 4161, 12483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12483: a binary palindrome (11000011000011); a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
12483 is composite. Its prime factorisation is
- 3
The divisors add up to 19240; without 12483 itself that is 6757, so 12483 is deficient (6757 is less than 12483). Euler's totient φ(12483) = 7776 numbers up to 12483 share no factor with it.
- 4
The digits of 12483 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 50 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12483 = 3^{2} \times 19 \times 73 \]12483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 19240 |
| Euler totient φ(n) | 7776 |
| Square | 155825289 |
| Cube | 1945167082587 |
| Square root | 111.727347 (= 3√1387) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 50 |
| Scientific notation | 1.2483 × |
12483 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand four hundred and eighty-three |
| Binary (base 2) | 11000011000011 |
| Octal (base 8) | 30303 |
| Hexadecimal (base 16) | 30C3 |
| Base 3 | 122010100 |
| As time | 12483 seconds = 3 h 28 min 3 s |
Is 12483 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 (12483 ÷ 3 = 4161) | 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 3) | 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 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 | No (remainder 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (12483 ÷ 9 = 1387) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 12483 a prime number?
No. 12483 = × 19 × 73, so it is divisible by 3.
What are the factors of 12483?
1, 3, 9, 19, 57, 73, 171, 219, 657, 1387, 4161, 12483.
What is 12483 in binary?
11000011000011 (hexadecimal 30C3, octal 30303).
What is the square root of 12483?
About 111.7273, exactly 3√1387.
Is 12483 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 12483?
12483 is a binary palindrome (11000011000011); a happy number: repeatedly adding the squares of its digits reaches 1.