The number 10270
10270 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 13 × 79. Divisors (16): 1, 2, 5, 10, 13, 26, 65, 79, 130, 158, 395, 790, 1027, 2054, 5135, 10270.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10270: a Harshad number: divisible by its digit sum 10.
- 2
10270 is composite. Its prime factorisation is
- 3
The divisors add up to 20160; without 10270 itself that is 9890, so 10270 is deficient (9890 is less than 10270). Euler's totient φ(10270) = 3744 numbers up to 10270 share no factor with it.
- 4
The digits of 10270 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10270 = 2 \times 5 \times 13 \times 79 \]
10270 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 20160 |
| Euler totient φ(n) | 3744 |
| Square | 105472900 |
| Cube | 1083206683000 |
| Square root | 101.341008 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 148 |
| Scientific notation | 1.027 × |
10270 in other forms
| Form | Value |
|---|---|
| In words | ten thousand two hundred and seventy |
| Binary (base 2) | 10100000011110 |
| Octal (base 8) | 24036 |
| Hexadecimal (base 16) | 281E |
| Base 3 | 112002101 |
| As time | 10270 seconds = 2 h 51 min 10 s |
Is 10270 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10270 ÷ 2 = 5135) | 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 (10270 ÷ 5 = 2054) | 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 | No (remainder 1) | 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 6) | 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 (10270 ÷ 10 = 1027) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10270 a prime number?
No. 10270 = 2 × 5 × 13 × 79, so it is divisible by 2.
What are the factors of 10270?
1, 2, 5, 10, 13, 26, 65, 79, 130, 158, 395, 790, 1027, 2054, 5135, 10270.
What is 10270 in binary?
10100000011110 (hexadecimal 281E, octal 24036).
What is the square root of 10270?
About 101.3410.
Is 10270 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 10270?
10270 is a Harshad number: divisible by its digit sum 10.