The number 10701
10701 is a palindrome: it reads 10701 backwards too. Its prime factorisation is × 29 × 41. Divisors (12): 1, 3, 9, 29, 41, 87, 123, 261, 369, 1189, 3567, 10701.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10701: a palindrome: it reads 10701 backwards too; a Harshad number: divisible by its digit sum 9.
- 2
10701 is composite. Its prime factorisation is
- 3
The divisors add up to 16380; without 10701 itself that is 5679, so 10701 is deficient (5679 is less than 10701). Euler's totient φ(10701) = 6720 numbers up to 10701 share no factor with it.
- 4
The digits of 10701 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10701 = 3^{2} \times 29 \times 41 \]10701 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 16380 |
| Euler totient φ(n) | 6720 |
| Square | 114511401 |
| Cube | 1225386502101 |
| Square root | 103.445638 (= 3√1189) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 47 |
| Scientific notation | 1.0701 × |
10701 in other forms
| Form | Value |
|---|---|
| In words | ten thousand seven hundred and one |
| Binary (base 2) | 10100111001101 |
| Octal (base 8) | 24715 |
| Hexadecimal (base 16) | 29CD |
| Base 3 | 112200100 |
| As time | 10701 seconds = 2 h 58 min 21 s |
Is 10701 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 (10701 ÷ 3 = 3567) | 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 1) | 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 5) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (10701 ÷ 9 = 1189) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10701 a prime number?
No. 10701 = × 29 × 41, so it is divisible by 3.
What are the factors of 10701?
1, 3, 9, 29, 41, 87, 123, 261, 369, 1189, 3567, 10701.
What is 10701 in binary?
10100111001101 (hexadecimal 29CD, octal 24715).
What is the square root of 10701?
About 103.4456, exactly 3√1189.
Is 10701 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 10701?
10701 is a palindrome: it reads 10701 backwards too; a Harshad number: divisible by its digit sum 9.