The number 12368
12368 is a composite number with 10 divisors. Its prime factorisation is × 773. Divisors (10): 1, 2, 4, 8, 16, 773, 1546, 3092, 6184, 12368.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12368 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12368 is composite. Its prime factorisation is
- 3
The divisors add up to 23994; without 12368 itself that is 11626, so 12368 is deficient (11626 is less than 12368). Euler's totient φ(12368) = 6176 numbers up to 12368 share no factor with it.
- 4
The digits of 12368 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 125 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12368 = 2^{4} \times 773 \]12368 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 23994 |
| Euler totient φ(n) | 6176 |
| Square | 152967424 |
| Cube | 1891901100032 |
| Square root | 111.211510 (= 4√773) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 125 |
| Scientific notation | 1.2368 × |
12368 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand three hundred and sixty-eight |
| Binary (base 2) | 11000001010000 |
| Octal (base 8) | 30120 |
| Hexadecimal (base 16) | 3050 |
| Base 3 | 121222002 |
| As time | 12368 seconds = 3 h 26 min 8 s |
Is 12368 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12368 ÷ 2 = 6184) | 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 (12368 ÷ 4 = 3092) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 (12368 ÷ 8 = 1546) | 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 8) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12368 a prime number?
No. 12368 = × 773, so it is divisible by 2.
What are the factors of 12368?
1, 2, 4, 8, 16, 773, 1546, 3092, 6184, 12368.
What is 12368 in binary?
11000001010000 (hexadecimal 3050, octal 30120).
What is the square root of 12368?
About 111.2115, exactly 4√773.
Is 12368 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 12368?
It is a composite number with 10 divisors.