The number 22009
22009 is a composite number with 4 divisors. Its prime factorisation is 13 × 1693. Divisors (4): 1, 13, 1693, 22009.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 22009: a Harshad number: divisible by its digit sum 13; a semiprime: 13 × 1693, the product of two primes.
- 2
22009 is composite. Its prime factorisation is
- 3
The divisors add up to 23716; without 22009 itself that is 1707, so 22009 is deficient (1707 is less than 22009). Euler's totient φ(22009) = 20304 numbers up to 22009 share no factor with it.
- 4
The digits of 22009 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 74 steps to reach 1.
LaTeX source of the formulas on this page
\[ 22009 = 13 \times 1693 \]
22009 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 23716 |
| Euler totient φ(n) | 20304 |
| Square | 484396081 |
| Cube | 10661073346729 |
| Square root | 148.354306 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 74 |
| Scientific notation | 2.2009 × |
22009 in other forms
| Form | Value |
|---|---|
| In words | twenty-two thousand and nine |
| Binary (base 2) | 101010111111001 |
| Octal (base 8) | 52771 |
| Hexadecimal (base 16) | 55F9 |
| Base 3 | 1010012011 |
| As time | 22009 seconds = 6 h 6 min 49 s |
Is 22009 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 1) | 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 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 9) | 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 22009 a prime number?
No. 22009 = 13 × 1693, so it is divisible by 13.
What are the factors of 22009?
1, 13, 1693, 22009.
What is 22009 in binary?
101010111111001 (hexadecimal 55F9, octal 52771).
What is the square root of 22009?
About 148.3543.
Is 22009 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 22009?
22009 is a Harshad number: divisible by its digit sum 13; a semiprime: 13 × 1693, the product of two primes.