The number 10366
10366 is a composite number with 8 divisors. Its prime factorisation is 2 × 71 × 73. Divisors (8): 1, 2, 71, 73, 142, 146, 5183, 10366.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10366: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
10366 is composite. Its prime factorisation is
- 3
The divisors add up to 15984; without 10366 itself that is 5618, so 10366 is deficient (5618 is less than 10366). Euler's totient φ(10366) = 5040 numbers up to 10366 share no factor with it.
- 4
The digits of 10366 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10366 = 2 \times 71 \times 73 \]
10366 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 15984 |
| Euler totient φ(n) | 5040 |
| Square | 107453956 |
| Cube | 1113867707896 |
| Square root | 101.813555 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 55 |
| Scientific notation | 1.0366 × |
10366 in other forms
| Form | Value |
|---|---|
| In words | ten thousand three hundred and sixty-six |
| Binary (base 2) | 10100001111110 |
| Octal (base 8) | 24176 |
| Hexadecimal (base 16) | 287E |
| Base 3 | 112012221 |
| As time | 10366 seconds = 2 h 52 min 46 s |
Is 10366 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10366 ÷ 2 = 5183) | 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 | No (remainder 1) | 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 6) | 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 7) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10366 a prime number?
No. 10366 = 2 × 71 × 73, so it is divisible by 2.
What are the factors of 10366?
1, 2, 71, 73, 142, 146, 5183, 10366.
What is 10366 in binary?
10100001111110 (hexadecimal 287E, octal 24176).
What is the square root of 10366?
About 101.8136.
Is 10366 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 10366?
10366 is a happy number: repeatedly adding the squares of its digits reaches 1.