The number 15290
15290 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 11 × 139. Divisors (16): 1, 2, 5, 10, 11, 22, 55, 110, 139, 278, 695, 1390, 1529, 3058, 7645, 15290.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15290 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15290 is composite. Its prime factorisation is
- 3
The divisors add up to 30240; without 15290 itself that is 14950, so 15290 is deficient (14950 is less than 15290). Euler's totient φ(15290) = 5520 numbers up to 15290 share no factor with it.
- 4
The digits of 15290 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 32 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15290 = 2 \times 5 \times 11 \times 139 \]
15290 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 30240 |
| Euler totient φ(n) | 5520 |
| Square | 233784100 |
| Cube | 3574558889000 |
| Square root | 123.652740 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 32 |
| Scientific notation | 1.529 × |
15290 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand two hundred and ninety |
| Binary (base 2) | 11101110111010 |
| Octal (base 8) | 35672 |
| Hexadecimal (base 16) | 3BBA |
| Base 3 | 202222022 |
| As time | 15290 seconds = 4 h 14 min 50 s |
Is 15290 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15290 ÷ 2 = 7645) | 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 | Yes (15290 ÷ 5 = 3058) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (15290 ÷ 10 = 1529) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (15290 ÷ 11 = 1390) | 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 15290 a prime number?
No. 15290 = 2 × 5 × 11 × 139, so it is divisible by 2.
What are the factors of 15290?
1, 2, 5, 10, 11, 22, 55, 110, 139, 278, 695, 1390, 1529, 3058, 7645, 15290.
What is 15290 in binary?
11101110111010 (hexadecimal 3BBA, octal 35672).
What is the square root of 15290?
About 123.6527.
Is 15290 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 15290?
It is a composite number with 16 divisors.