The number 10256
10256 is a composite number with 10 divisors. Its prime factorisation is × 641. Divisors (10): 1, 2, 4, 8, 16, 641, 1282, 2564, 5128, 10256.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10256 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10256 is composite. Its prime factorisation is
- 3
The divisors add up to 19902; without 10256 itself that is 9646, so 10256 is deficient (9646 is less than 10256). Euler's totient φ(10256) = 5120 numbers up to 10256 share no factor with it.
- 4
The digits of 10256 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10256 = 2^{4} \times 641 \]10256 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 19902 |
| Euler totient φ(n) | 5120 |
| Square | 105185536 |
| Cube | 1078782857216 |
| Square root | 101.271911 (= 4√641) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 55 |
| Scientific notation | 1.0256 × |
10256 in other forms
| Form | Value |
|---|---|
| In words | ten thousand two hundred and fifty-six |
| Binary (base 2) | 10100000010000 |
| Octal (base 8) | 24020 |
| Hexadecimal (base 16) | 2810 |
| Base 3 | 112001212 |
| As time | 10256 seconds = 2 h 50 min 56 s |
Is 10256 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10256 ÷ 2 = 5128) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (10256 ÷ 4 = 2564) | 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 2) | 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 | Yes (10256 ÷ 8 = 1282) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10256 a prime number?
No. 10256 = × 641, so it is divisible by 2.
What are the factors of 10256?
1, 2, 4, 8, 16, 641, 1282, 2564, 5128, 10256.
What is 10256 in binary?
10100000010000 (hexadecimal 2810, octal 24020).
What is the square root of 10256?
About 101.2719, exactly 4√641.
Is 10256 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 10256?
It is a composite number with 10 divisors.