The number 15492
15492 is a composite number with 12 divisors. Its prime factorisation is × 3 × 1291. Divisors (12): 1, 2, 3, 4, 6, 12, 1291, 2582, 3873, 5164, 7746, 15492.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15492 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15492 is composite. Its prime factorisation is
- 3
The divisors add up to 36176; without 15492 itself that is 20684, so 15492 is abundant (20684 is more than 15492). Euler's totient φ(15492) = 5160 numbers up to 15492 share no factor with it.
- 4
The digits of 15492 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15492 = 2^{2} \times 3 \times 1291 \]15492 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 36176 |
| Euler totient φ(n) | 5160 |
| Square | 240002064 |
| Cube | 3718111975488 |
| Square root | 124.466863 (= 2√3873) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 53 |
| Scientific notation | 1.5492 × |
15492 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand four hundred and ninety-two |
| Binary (base 2) | 11110010000100 |
| Octal (base 8) | 36204 |
| Hexadecimal (base 16) | 3C84 |
| Base 3 | 210020210 |
| As time | 15492 seconds = 4 h 18 min 12 s |
Is 15492 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15492 ÷ 2 = 7746) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (15492 ÷ 3 = 5164) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (15492 ÷ 4 = 3873) | 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 | Yes (15492 ÷ 6 = 2582) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (15492 ÷ 12 = 1291) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15492 a prime number?
No. 15492 = × 3 × 1291, so it is divisible by 2.
What are the factors of 15492?
1, 2, 3, 4, 6, 12, 1291, 2582, 3873, 5164, 7746, 15492.
What is 15492 in binary?
11110010000100 (hexadecimal 3C84, octal 36204).
What is the square root of 15492?
About 124.4669, exactly 2√3873.
Is 15492 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 15492?
It is a composite number with 12 divisors.