The number 12476
12476 is a composite number with 6 divisors. Its prime factorisation is × 3119. Divisors (6): 1, 2, 4, 3119, 6238, 12476.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12476 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12476 is composite. Its prime factorisation is
- 3
The divisors add up to 21840; without 12476 itself that is 9364, so 12476 is deficient (9364 is less than 12476). Euler's totient φ(12476) = 6236 numbers up to 12476 share no factor with it.
- 4
The digits of 12476 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 50 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12476 = 2^{2} \times 3119 \]12476 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 21840 |
| Euler totient φ(n) | 6236 |
| Square | 155650576 |
| Cube | 1941896586176 |
| Square root | 111.696016 (= 2√3119) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 50 |
| Scientific notation | 1.2476 × |
12476 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand four hundred and seventy-six |
| Binary (base 2) | 11000010111100 |
| Octal (base 8) | 30274 |
| Hexadecimal (base 16) | 30BC |
| Base 3 | 122010002 |
| As time | 12476 seconds = 3 h 27 min 56 s |
Is 12476 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12476 ÷ 2 = 6238) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (12476 ÷ 4 = 3119) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12476 a prime number?
No. 12476 = × 3119, so it is divisible by 2.
What are the factors of 12476?
1, 2, 4, 3119, 6238, 12476.
What is 12476 in binary?
11000010111100 (hexadecimal 30BC, octal 30274).
What is the square root of 12476?
About 111.6960, exactly 2√3119.
Is 12476 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 12476?
It is a composite number with 6 divisors.