The number 14769
14769 is a composite number with 8 divisors. Its prime factorisation is × 547. Divisors (8): 1, 3, 9, 27, 547, 1641, 4923, 14769.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14769: a Harshad number: divisible by its digit sum 27.
- 2
14769 is composite. Its prime factorisation is
- 3
The divisors add up to 21920; without 14769 itself that is 7151, so 14769 is deficient (7151 is less than 14769). Euler's totient φ(14769) = 9828 numbers up to 14769 share no factor with it.
- 4
The digits of 14769 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14769 = 3^{3} \times 547 \]14769 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 21920 |
| Euler totient φ(n) | 9828 |
| Square | 218123361 |
| Cube | 3221463918609 |
| Square root | 121.527775 (= 3√1641) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.4769 × |
14769 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand seven hundred and sixty-nine |
| Binary (base 2) | 11100110110001 |
| Octal (base 8) | 34661 |
| Hexadecimal (base 16) | 39B1 |
| Base 3 | 202021000 |
| As time | 14769 seconds = 4 h 6 min 9 s |
Is 14769 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 (14769 ÷ 3 = 4923) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (14769 ÷ 9 = 1641) | 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 7) | 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 14769 a prime number?
No. 14769 = × 547, so it is divisible by 3.
What are the factors of 14769?
1, 3, 9, 27, 547, 1641, 4923, 14769.
What is 14769 in binary?
11100110110001 (hexadecimal 39B1, octal 34661).
What is the square root of 14769?
About 121.5278, exactly 3√1641.
Is 14769 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 14769?
14769 is a Harshad number: divisible by its digit sum 27.