The number 10361
10361 is a composite number with 4 divisors. Its prime factorisation is 13 × 797. Divisors (4): 1, 13, 797, 10361.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10361: a semiprime: 13 × 797, the product of two primes.
- 2
10361 is composite. Its prime factorisation is
- 3
The divisors add up to 11172; without 10361 itself that is 811, so 10361 is deficient (811 is less than 10361). Euler's totient φ(10361) = 9552 numbers up to 10361 share no factor with it.
- 4
The digits of 10361 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 117 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10361 = 13 \times 797 \]
10361 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 11172 |
| Euler totient φ(n) | 9552 |
| Square | 107350321 |
| Cube | 1112256675881 |
| Square root | 101.788997 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 117 |
| Scientific notation | 1.0361 × |
10361 in other forms
| Form | Value |
|---|---|
| In words | ten thousand three hundred and sixty-one |
| Binary (base 2) | 10100001111001 |
| Octal (base 8) | 24171 |
| Hexadecimal (base 16) | 2879 |
| Base 3 | 112012202 |
| As time | 10361 seconds = 2 h 52 min 41 s |
Is 10361 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 | No (remainder 2) | 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 5) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10361 a prime number?
No. 10361 = 13 × 797, so it is divisible by 13.
What are the factors of 10361?
1, 13, 797, 10361.
What is 10361 in binary?
10100001111001 (hexadecimal 2879, octal 24171).
What is the square root of 10361?
About 101.7890.
Is 10361 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 10361?
10361 is a semiprime: 13 × 797, the product of two primes.