The number 11739
11739 is a composite number with 16 divisors. Its prime factorisation is 3 × 7 × 13 × 43. Divisors (16): 1, 3, 7, 13, 21, 39, 43, 91, 129, 273, 301, 559, 903, 1677, 3913, 11739.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11739: a Harshad number: divisible by its digit sum 21.
- 2
11739 is composite. Its prime factorisation is
- 3
The divisors add up to 19712; without 11739 itself that is 7973, so 11739 is deficient (7973 is less than 11739). Euler's totient φ(11739) = 6048 numbers up to 11739 share no factor with it.
- 4
The digits of 11739 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 50 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11739 = 3 \times 7 \times 13 \times 43 \]
11739 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 19712 |
| Euler totient φ(n) | 6048 |
| Square | 137804121 |
| Cube | 1617682576419 |
| Square root | 108.346666 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 50 |
| Scientific notation | 1.1739 × |
11739 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand seven hundred and thirty-nine |
| Binary (base 2) | 10110111011011 |
| Octal (base 8) | 26733 |
| Hexadecimal (base 16) | 2DDB |
| Base 3 | 121002210 |
| As time | 11739 seconds = 3 h 15 min 39 s |
Is 11739 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 (11739 ÷ 3 = 3913) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 (11739 ÷ 7 = 1677) | 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 3) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11739 a prime number?
No. 11739 = 3 × 7 × 13 × 43, so it is divisible by 3.
What are the factors of 11739?
1, 3, 7, 13, 21, 39, 43, 91, 129, 273, 301, 559, 903, 1677, 3913, 11739.
What is 11739 in binary?
10110111011011 (hexadecimal 2DDB, octal 26733).
What is the square root of 11739?
About 108.3467.
Is 11739 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 11739?
11739 is a Harshad number: divisible by its digit sum 21.