The number 51103
51103 is a composite number with 4 divisors. Its prime factorisation is 13 × 3931. Divisors (4): 1, 13, 3931, 51103.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51103: a semiprime: 13 × 3931, the product of two primes.
- 2
51103 is composite. Its prime factorisation is
- 3
The divisors add up to 55048; without 51103 itself that is 3945, so 51103 is deficient (3945 is less than 51103). Euler's totient φ(51103) = 47160 numbers up to 51103 share no factor with it.
- 4
The digits of 51103 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 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51103 = 13 \times 3931 \]
51103 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 55048 |
| Euler totient φ(n) | 47160 |
| Square | 2611516609 |
| Cube | 133456333269727 |
| Square root | 226.059727 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.1103 × |
51103 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand one hundred and three |
| Binary (base 2) | 1100011110011111 |
| Octal (base 8) | 143637 |
| Hexadecimal (base 16) | C79F |
| Base 3 | 2121002201 |
| As time | 51103 seconds = 14 h 11 min 43 s |
Is 51103 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 3) | 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 3) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 51103 a prime number?
No. 51103 = 13 × 3931, so it is divisible by 13.
What are the factors of 51103?
1, 13, 3931, 51103.
What is 51103 in binary?
1100011110011111 (hexadecimal C79F, octal 143637).
What is the square root of 51103?
About 226.0597.
Is 51103 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 51103?
51103 is a semiprime: 13 × 3931, the product of two primes.