The number 15103
15103 is a composite number with 4 divisors. Its prime factorisation is 11 × 1373. Divisors (4): 1, 11, 1373, 15103.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15103: a semiprime: 11 × 1373, the product of two primes.
- 2
15103 is composite. Its prime factorisation is
- 3
The divisors add up to 16488; without 15103 itself that is 1385, so 15103 is deficient (1385 is less than 15103). Euler's totient φ(15103) = 13720 numbers up to 15103 share no factor with it.
- 4
The digits of 15103 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 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15103 = 11 \times 1373 \]
15103 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16488 |
| Euler totient φ(n) | 13720 |
| Square | 228100609 |
| Cube | 3445003497727 |
| Square root | 122.894263 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 115 |
| Scientific notation | 1.5103 × |
15103 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and three |
| Binary (base 2) | 11101011111111 |
| Octal (base 8) | 35377 |
| Hexadecimal (base 16) | 3AFF |
| Base 3 | 202201101 |
| As time | 15103 seconds = 4 h 11 min 43 s |
Is 15103 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 4) | 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 | Yes (15103 ÷ 11 = 1373) | 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 15103 a prime number?
No. 15103 = 11 × 1373, so it is divisible by 11.
What are the factors of 15103?
1, 11, 1373, 15103.
What is 15103 in binary?
11101011111111 (hexadecimal 3AFF, octal 35377).
What is the square root of 15103?
About 122.8943.
Is 15103 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 15103?
15103 is a semiprime: 11 × 1373, the product of two primes.