The number 10351
10351 is a composite number with 4 divisors. Its prime factorisation is 11 × 941. Divisors (4): 1, 11, 941, 10351.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10351: a semiprime: 11 × 941, the product of two primes.
- 2
10351 is composite. Its prime factorisation is
- 3
The divisors add up to 11304; without 10351 itself that is 953, so 10351 is deficient (953 is less than 10351). Euler's totient φ(10351) = 9400 numbers up to 10351 share no factor with it.
- 4
The digits of 10351 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 117 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10351 = 11 \times 941 \]
10351 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 11304 |
| Euler totient φ(n) | 9400 |
| Square | 107143201 |
| Cube | 1109039273551 |
| Square root | 101.739864 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 117 |
| Scientific notation | 1.0351 × |
10351 in other forms
| Form | Value |
|---|---|
| In words | ten thousand three hundred and fifty-one |
| Binary (base 2) | 10100001101111 |
| Octal (base 8) | 24157 |
| Hexadecimal (base 16) | 286F |
| Base 3 | 112012101 |
| As time | 10351 seconds = 2 h 52 min 31 s |
Is 10351 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 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 1) | 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 7) | 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 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (10351 ÷ 11 = 941) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10351 a prime number?
No. 10351 = 11 × 941, so it is divisible by 11.
What are the factors of 10351?
1, 11, 941, 10351.
What is 10351 in binary?
10100001101111 (hexadecimal 286F, octal 24157).
What is the square root of 10351?
About 101.7399.
Is 10351 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 10351?
10351 is a semiprime: 11 × 941, the product of two primes.