The number 15498
15498 is a composite number with 32 divisors. Its prime factorisation is 2 × × 7 × 41. Divisors (32): 1, 2, 3, 6, 7, 9, 14, 18, 21, 27, 41, 42, 54, 63, 82, 123 … 15498.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15498: a Harshad number: divisible by its digit sum 27.
- 2
15498 is composite. Its prime factorisation is
- 3
The divisors add up to 40320; without 15498 itself that is 24822, so 15498 is abundant (24822 is more than 15498). Euler's totient φ(15498) = 4320 numbers up to 15498 share no factor with it.
- 4
The digits of 15498 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15498 = 2 \times 3^{3} \times 7 \times 41 \]15498 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 40320 |
| Euler totient φ(n) | 4320 |
| Square | 240188004 |
| Cube | 3722433685992 |
| Square root | 124.490964 (= 3√1722) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 53 |
| Scientific notation | 1.5498 × |
15498 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand four hundred and ninety-eight |
| Binary (base 2) | 11110010001010 |
| Octal (base 8) | 36212 |
| Hexadecimal (base 16) | 3C8A |
| Base 3 | 210021000 |
| As time | 15498 seconds = 4 h 18 min 18 s |
Is 15498 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15498 ÷ 2 = 7749) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (15498 ÷ 3 = 5166) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (15498 ÷ 6 = 2583) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (15498 ÷ 7 = 2214) | 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 | Yes (15498 ÷ 9 = 1722) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15498 a prime number?
No. 15498 = 2 × × 7 × 41, so it is divisible by 2.
What are the factors of 15498?
1, 2, 3, 6, 7, 9, 14, 18, 21, 27, 41, 42, 54, 63, 82, 123, 126, 189, 246, 287, 369, 378, 574, 738, 861, 1107, 1722, 2214, 2583, 5166, 7749, 15498.
What is 15498 in binary?
11110010001010 (hexadecimal 3C8A, octal 36212).
What is the square root of 15498?
About 124.4910, exactly 3√1722.
Is 15498 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 15498?
15498 is a Harshad number: divisible by its digit sum 27.