The number 15113
15113 is a composite number with 8 divisors. Its prime factorisation is 7 × 17 × 127. Divisors (8): 1, 7, 17, 119, 127, 889, 2159, 15113.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15113 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15113 is composite. Its prime factorisation is
- 3
The divisors add up to 18432; without 15113 itself that is 3319, so 15113 is deficient (3319 is less than 15113). Euler's totient φ(15113) = 12096 numbers up to 15113 share no factor with it.
- 4
The digits of 15113 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 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15113 = 7 \times 17 \times 127 \]
15113 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 18432 |
| Euler totient φ(n) | 12096 |
| Square | 228402769 |
| Cube | 3451851047897 |
| Square root | 122.934942 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.5113 × |
15113 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and thirteen |
| Binary (base 2) | 11101100001001 |
| Octal (base 8) | 35411 |
| Hexadecimal (base 16) | 3B09 |
| Base 3 | 202201202 |
| As time | 15113 seconds = 4 h 11 min 53 s |
Is 15113 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 3) | 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 | Yes (15113 ÷ 7 = 2159) | 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 3) | 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 15113 a prime number?
No. 15113 = 7 × 17 × 127, so it is divisible by 7.
What are the factors of 15113?
1, 7, 17, 119, 127, 889, 2159, 15113.
What is 15113 in binary?
11101100001001 (hexadecimal 3B09, octal 35411).
What is the square root of 15113?
About 122.9349.
Is 15113 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 15113?
It is a composite number with 8 divisors.