The number 15490
15490 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 1549. Divisors (8): 1, 2, 5, 10, 1549, 3098, 7745, 15490.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15490 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15490 is composite. Its prime factorisation is
- 3
The divisors add up to 27900; without 15490 itself that is 12410, so 15490 is deficient (12410 is less than 15490). Euler's totient φ(15490) = 6192 numbers up to 15490 share no factor with it.
- 4
The digits of 15490 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15490 = 2 \times 5 \times 1549 \]
15490 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 27900 |
| Euler totient φ(n) | 6192 |
| Square | 239940100 |
| Cube | 3716672149000 |
| Square root | 124.458829 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 53 |
| Scientific notation | 1.549 × |
15490 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand four hundred and ninety |
| Binary (base 2) | 11110010000010 |
| Octal (base 8) | 36202 |
| Hexadecimal (base 16) | 3C82 |
| Base 3 | 210020201 |
| As time | 15490 seconds = 4 h 18 min 10 s |
Is 15490 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15490 ÷ 2 = 7745) | 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 | Yes (15490 ÷ 5 = 3098) | 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 | No (remainder 6) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (15490 ÷ 10 = 1549) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 15490 a prime number?
No. 15490 = 2 × 5 × 1549, so it is divisible by 2.
What are the factors of 15490?
1, 2, 5, 10, 1549, 3098, 7745, 15490.
What is 15490 in binary?
11110010000010 (hexadecimal 3C82, octal 36202).
What is the square root of 15490?
About 124.4588.
Is 15490 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 15490?
It is a composite number with 8 divisors.