The number 15494
15494 is a composite number with 8 divisors. Its prime factorisation is 2 × 61 × 127. Divisors (8): 1, 2, 61, 122, 127, 254, 7747, 15494.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15494: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
15494 is composite. Its prime factorisation is
- 3
The divisors add up to 23808; without 15494 itself that is 8314, so 15494 is deficient (8314 is less than 15494). Euler's totient φ(15494) = 7560 numbers up to 15494 share no factor with it.
- 4
The digits of 15494 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15494 = 2 \times 61 \times 127 \]
15494 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 23808 |
| Euler totient φ(n) | 7560 |
| Square | 240064036 |
| Cube | 3719552173784 |
| Square root | 124.474897 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 53 |
| Scientific notation | 1.5494 × |
15494 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand four hundred and ninety-four |
| Binary (base 2) | 11110010000110 |
| Octal (base 8) | 36206 |
| Hexadecimal (base 16) | 3C86 |
| Base 3 | 210020212 |
| As time | 15494 seconds = 4 h 18 min 14 s |
Is 15494 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15494 ÷ 2 = 7747) | 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 4) | 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 3) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 15494 a prime number?
No. 15494 = 2 × 61 × 127, so it is divisible by 2.
What are the factors of 15494?
1, 2, 61, 122, 127, 254, 7747, 15494.
What is 15494 in binary?
11110010000110 (hexadecimal 3C86, octal 36206).
What is the square root of 15494?
About 124.4749.
Is 15494 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 15494?
15494 is a happy number: repeatedly adding the squares of its digits reaches 1.