The number 14770
14770 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 7 × 211. Divisors (16): 1, 2, 5, 7, 10, 14, 35, 70, 211, 422, 1055, 1477, 2110, 2954, 7385, 14770.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14770 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14770 is composite. Its prime factorisation is
- 3
The divisors add up to 30528; without 14770 itself that is 15758, so 14770 is abundant (15758 is more than 14770). Euler's totient φ(14770) = 5040 numbers up to 14770 share no factor with it.
- 4
The digits of 14770 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14770 = 2 \times 5 \times 7 \times 211 \]
14770 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 30528 |
| Euler totient φ(n) | 5040 |
| Square | 218152900 |
| Cube | 3222118333000 |
| Square root | 121.531889 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.477 × |
14770 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand seven hundred and seventy |
| Binary (base 2) | 11100110110010 |
| Octal (base 8) | 34662 |
| Hexadecimal (base 16) | 39B2 |
| Base 3 | 202021001 |
| As time | 14770 seconds = 4 h 6 min 10 s |
Is 14770 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14770 ÷ 2 = 7385) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (14770 ÷ 5 = 2954) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (14770 ÷ 7 = 2110) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (14770 ÷ 10 = 1477) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14770 a prime number?
No. 14770 = 2 × 5 × 7 × 211, so it is divisible by 2.
What are the factors of 14770?
1, 2, 5, 7, 10, 14, 35, 70, 211, 422, 1055, 1477, 2110, 2954, 7385, 14770.
What is 14770 in binary?
11100110110010 (hexadecimal 39B2, octal 34662).
What is the square root of 14770?
About 121.5319.
Is 14770 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 14770?
It is a composite number with 16 divisors.