The number 12464
12464 is a composite number with 20 divisors. Its prime factorisation is × 19 × 41. Divisors (20): 1, 2, 4, 8, 16, 19, 38, 41, 76, 82, 152, 164, 304, 328, 656, 779 … 12464.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12464 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12464 is composite. Its prime factorisation is
- 3
The divisors add up to 26040; without 12464 itself that is 13576, so 12464 is abundant (13576 is more than 12464). Euler's totient φ(12464) = 5760 numbers up to 12464 share no factor with it.
- 4
The digits of 12464 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12464 = 2^{4} \times 19 \times 41 \]12464 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 26040 |
| Euler totient φ(n) | 5760 |
| Square | 155351296 |
| Cube | 1936298553344 |
| Square root | 111.642286 (= 4√779) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 63 |
| Scientific notation | 1.2464 × |
12464 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand four hundred and sixty-four |
| Binary (base 2) | 11000010110000 |
| Octal (base 8) | 30260 |
| Hexadecimal (base 16) | 30B0 |
| Base 3 | 122002122 |
| As time | 12464 seconds = 3 h 27 min 44 s |
Is 12464 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12464 ÷ 2 = 6232) | 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 (12464 ÷ 4 = 3116) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 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 | Yes (12464 ÷ 8 = 1558) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 12464 a prime number?
No. 12464 = × 19 × 41, so it is divisible by 2.
What are the factors of 12464?
1, 2, 4, 8, 16, 19, 38, 41, 76, 82, 152, 164, 304, 328, 656, 779, 1558, 3116, 6232, 12464.
What is 12464 in binary?
11000010110000 (hexadecimal 30B0, octal 30260).
What is the square root of 12464?
About 111.6423, exactly 4√779.
Is 12464 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 12464?
It is a composite number with 20 divisors.