The number 12469
12469 is a composite number with 4 divisors. Its prime factorisation is 37 × 337. Divisors (4): 1, 37, 337, 12469.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12469: a semiprime: 37 × 337, the product of two primes.
- 2
12469 is composite. Its prime factorisation is
- 3
The divisors add up to 12844; without 12469 itself that is 375, so 12469 is deficient (375 is less than 12469). Euler's totient φ(12469) = 12096 numbers up to 12469 share no factor with it.
- 4
The digits of 12469 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12469 = 37 \times 337 \]
12469 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 12844 |
| Euler totient φ(n) | 12096 |
| Square | 155475961 |
| Cube | 1938629757709 |
| Square root | 111.664677 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 63 |
| Scientific notation | 1.2469 × |
12469 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand four hundred and sixty-nine |
| Binary (base 2) | 11000010110101 |
| Octal (base 8) | 30265 |
| Hexadecimal (base 16) | 30B5 |
| Base 3 | 122002211 |
| As time | 12469 seconds = 3 h 27 min 49 s |
Is 12469 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 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 4) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12469 a prime number?
No. 12469 = 37 × 337, so it is divisible by 37.
What are the factors of 12469?
1, 37, 337, 12469.
What is 12469 in binary?
11000010110101 (hexadecimal 30B5, octal 30265).
What is the square root of 12469?
About 111.6647.
Is 12469 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 12469?
12469 is a semiprime: 37 × 337, the product of two primes.