The number 12467
12467 is a composite number with 8 divisors. Its prime factorisation is 7 × 13 × 137. Divisors (8): 1, 7, 13, 91, 137, 959, 1781, 12467.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12467 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12467 is composite. Its prime factorisation is
- 3
The divisors add up to 15456; without 12467 itself that is 2989, so 12467 is deficient (2989 is less than 12467). Euler's totient φ(12467) = 9792 numbers up to 12467 share no factor with it.
- 4
The digits of 12467 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 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12467 = 7 \times 13 \times 137 \]
12467 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 15456 |
| Euler totient φ(n) | 9792 |
| Square | 155426089 |
| Cube | 1937697051563 |
| Square root | 111.655721 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 63 |
| Scientific notation | 1.2467 × |
12467 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand four hundred and sixty-seven |
| Binary (base 2) | 11000010110011 |
| Octal (base 8) | 30263 |
| Hexadecimal (base 16) | 30B3 |
| Base 3 | 122002202 |
| As time | 12467 seconds = 3 h 27 min 47 s |
Is 12467 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 | No (remainder 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (12467 ÷ 7 = 1781) | 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 2) | 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 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12467 a prime number?
No. 12467 = 7 × 13 × 137, so it is divisible by 7.
What are the factors of 12467?
1, 7, 13, 91, 137, 959, 1781, 12467.
What is 12467 in binary?
11000010110011 (hexadecimal 30B3, octal 30263).
What is the square root of 12467?
About 111.6557.
Is 12467 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 12467?
It is a composite number with 8 divisors.