The number 15122
15122 is a composite number with 4 divisors. Its prime factorisation is 2 × 7561. Divisors (4): 1, 2, 7561, 15122.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15122: a semiprime: 2 × 7561, the product of two primes.
- 2
15122 is composite. Its prime factorisation is
- 3
The divisors add up to 22686; without 15122 itself that is 7564, so 15122 is deficient (7564 is less than 15122). Euler's totient φ(15122) = 7560 numbers up to 15122 share no factor with it.
- 4
The digits of 15122 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 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15122 = 2 \times 7561 \]
15122 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 22686 |
| Euler totient φ(n) | 7560 |
| Square | 228674884 |
| Cube | 3458021595848 |
| Square root | 122.971541 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 84 |
| Scientific notation | 1.5122 × |
15122 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and twenty-two |
| Binary (base 2) | 11101100010010 |
| Octal (base 8) | 35422 |
| Hexadecimal (base 16) | 3B12 |
| Base 3 | 202202002 |
| As time | 15122 seconds = 4 h 12 min 2 s |
Is 15122 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15122 ÷ 2 = 7561) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15122 a prime number?
No. 15122 = 2 × 7561, so it is divisible by 2.
What are the factors of 15122?
1, 2, 7561, 15122.
What is 15122 in binary?
11101100010010 (hexadecimal 3B12, octal 35422).
What is the square root of 15122?
About 122.9715.
Is 15122 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 15122?
15122 is a semiprime: 2 × 7561, the product of two primes.