The number 15106
15106 is a composite number with 16 divisors. Its prime factorisation is 2 × 7 × 13 × 83. Divisors (16): 1, 2, 7, 13, 14, 26, 83, 91, 166, 182, 581, 1079, 1162, 2158, 7553, 15106.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15106: a Harshad number: divisible by its digit sum 13.
- 2
15106 is composite. Its prime factorisation is
- 3
The divisors add up to 28224; without 15106 itself that is 13118, so 15106 is deficient (13118 is less than 15106). Euler's totient φ(15106) = 5904 numbers up to 15106 share no factor with it.
- 4
The digits of 15106 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15106 = 2 \times 7 \times 13 \times 83 \]
15106 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 28224 |
| Euler totient φ(n) | 5904 |
| Square | 228191236 |
| Cube | 3447056811016 |
| Square root | 122.906469 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.5106 × |
15106 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and six |
| Binary (base 2) | 11101100000010 |
| Octal (base 8) | 35402 |
| Hexadecimal (base 16) | 3B02 |
| Base 3 | 202201111 |
| As time | 15106 seconds = 4 h 11 min 46 s |
Is 15106 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15106 ÷ 2 = 7553) | 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 2) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (15106 ÷ 7 = 2158) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15106 a prime number?
No. 15106 = 2 × 7 × 13 × 83, so it is divisible by 2.
What are the factors of 15106?
1, 2, 7, 13, 14, 26, 83, 91, 166, 182, 581, 1079, 1162, 2158, 7553, 15106.
What is 15106 in binary?
11101100000010 (hexadecimal 3B02, octal 35402).
What is the square root of 15106?
About 122.9065.
Is 15106 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 15106?
15106 is a Harshad number: divisible by its digit sum 13.