The number 12463
12463 is a composite number with 6 divisors. Its prime factorisation is Ć 103. Divisors (6): 1, 11, 103, 121, 1133, 12463.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12463 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12463 is composite. Its prime factorisation is
- 3
The divisors add up to 13832; without 12463 itself that is 1369, so 12463 is deficient (1369 is less than 12463). Euler's totient Ļ(12463) = 11220 numbers up to 12463 share no factor with it.
- 4
The digits of 12463 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 187 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12463 = 11^{2} \times 103 \]12463 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 13832 |
| Euler totient Ļ(n) | 11220 |
| Square | 155326369 |
| Cube | 1935832536847 |
| Square root | 111.637807 (= 11ā103) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 187 |
| Scientific notation | 1.2463 Ć |
12463 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand four hundred and sixty-three |
| Binary (base 2) | 11000010101111 |
| Octal (base 8) | 30257 |
| Hexadecimal (base 16) | 30AF |
| Base 3 | 122002121 |
| As time | 12463 seconds = 3 h 27 min 43 s |
Is 12463 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 | Yes (12463 Ć· 11 = 1133) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12463 a prime number?
No. 12463 = Ć 103, so it is divisible by 11.
What are the factors of 12463?
1, 11, 103, 121, 1133, 12463.
What is 12463 in binary?
11000010101111 (hexadecimal 30AF, octal 30257).
What is the square root of 12463?
About 111.6378, exactly 11ā103.
Is 12463 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 12463?
It is a composite number with 6 divisors.