The number 12669
12669 is a composite number with 8 divisors. Its prime factorisation is 3 × 41 × 103. Divisors (8): 1, 3, 41, 103, 123, 309, 4223, 12669.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12669 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12669 is composite. Its prime factorisation is
- 3
The divisors add up to 17472; without 12669 itself that is 4803, so 12669 is deficient (4803 is less than 12669). Euler's totient φ(12669) = 8160 numbers up to 12669 share no factor with it.
- 4
The digits of 12669 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 169 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12669 = 3 \times 41 \times 103 \]
12669 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 17472 |
| Euler totient φ(n) | 8160 |
| Square | 160503561 |
| Cube | 2033419614309 |
| Square root | 112.556652 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 169 |
| Scientific notation | 1.2669 × |
12669 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand six hundred and sixty-nine |
| Binary (base 2) | 11000101111101 |
| Octal (base 8) | 30575 |
| Hexadecimal (base 16) | 317D |
| Base 3 | 122101020 |
| As time | 12669 seconds = 3 h 31 min 9 s |
Is 12669 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 (12669 ÷ 3 = 4223) | 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 | 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 | No (remainder 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 8) | 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 12669 a prime number?
No. 12669 = 3 × 41 × 103, so it is divisible by 3.
What are the factors of 12669?
1, 3, 41, 103, 123, 309, 4223, 12669.
What is 12669 in binary?
11000101111101 (hexadecimal 317D, octal 30575).
What is the square root of 12669?
About 112.5567.
Is 12669 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 12669?
It is a composite number with 8 divisors.