The number 12369
12369 is a composite number with 16 divisors. Its prime factorisation is 3 × 7 × 19 × 31. Divisors (16): 1, 3, 7, 19, 21, 31, 57, 93, 133, 217, 399, 589, 651, 1767, 4123, 12369.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12369: a Harshad number: divisible by its digit sum 21.
- 2
12369 is composite. Its prime factorisation is
- 3
The divisors add up to 20480; without 12369 itself that is 8111, so 12369 is deficient (8111 is less than 12369). Euler's totient φ(12369) = 6480 numbers up to 12369 share no factor with it.
- 4
The digits of 12369 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12369 = 3 \times 7 \times 19 \times 31 \]
12369 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 20480 |
| Euler totient φ(n) | 6480 |
| Square | 152992161 |
| Cube | 1892360039409 |
| Square root | 111.216006 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 63 |
| Scientific notation | 1.2369 × |
12369 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand three hundred and sixty-nine |
| Binary (base 2) | 11000001010001 |
| Octal (base 8) | 30121 |
| Hexadecimal (base 16) | 3051 |
| Base 3 | 121222010 |
| As time | 12369 seconds = 3 h 26 min 9 s |
Is 12369 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 | Yes (12369 ÷ 3 = 4123) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (12369 ÷ 7 = 1767) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12369 a prime number?
No. 12369 = 3 × 7 × 19 × 31, so it is divisible by 3.
What are the factors of 12369?
1, 3, 7, 19, 21, 31, 57, 93, 133, 217, 399, 589, 651, 1767, 4123, 12369.
What is 12369 in binary?
11000001010001 (hexadecimal 3051, octal 30121).
What is the square root of 12369?
About 111.2160.
Is 12369 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 12369?
12369 is a Harshad number: divisible by its digit sum 21.