The number 10770
10770 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 359. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 359, 718, 1077, 1795, 2154, 3590, 5385, 10770.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10770: a Harshad number: divisible by its digit sum 15.
- 2
10770 is composite. Its prime factorisation is
- 3
The divisors add up to 25920; without 10770 itself that is 15150, so 10770 is abundant (15150 is more than 10770). Euler's totient φ(10770) = 2864 numbers up to 10770 share no factor with it.
- 4
The digits of 10770 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10770 = 2 \times 3 \times 5 \times 359 \]
10770 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 25920 |
| Euler totient φ(n) | 2864 |
| Square | 115992900 |
| Cube | 1249243533000 |
| Square root | 103.778611 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 148 |
| Scientific notation | 1.077 × |
10770 in other forms
| Form | Value |
|---|---|
| In words | ten thousand seven hundred and seventy |
| Binary (base 2) | 10101000010010 |
| Octal (base 8) | 25022 |
| Hexadecimal (base 16) | 2A12 |
| Base 3 | 112202220 |
| As time | 10770 seconds = 2 h 59 min 30 s |
Is 10770 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10770 ÷ 2 = 5385) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (10770 ÷ 3 = 3590) | 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 (10770 ÷ 5 = 2154) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (10770 ÷ 6 = 1795) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (10770 ÷ 10 = 1077) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10770 a prime number?
No. 10770 = 2 × 3 × 5 × 359, so it is divisible by 2.
What are the factors of 10770?
1, 2, 3, 5, 6, 10, 15, 30, 359, 718, 1077, 1795, 2154, 3590, 5385, 10770.
What is 10770 in binary?
10101000010010 (hexadecimal 2A12, octal 25022).
What is the square root of 10770?
About 103.7786.
Is 10770 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 10770?
10770 is a Harshad number: divisible by its digit sum 15.