The number 15049
15049 is a composite number with 4 divisors. Its prime factorisation is 101 × 149. Divisors (4): 1, 101, 149, 15049.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15049: a semiprime: 101 × 149, the product of two primes.
- 2
15049 is composite. Its prime factorisation is
- 3
The divisors add up to 15300; without 15049 itself that is 251, so 15049 is deficient (251 is less than 15049). Euler's totient φ(15049) = 14800 numbers up to 15049 share no factor with it.
- 4
The digits of 15049 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 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15049 = 101 \times 149 \]
15049 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15300 |
| Euler totient φ(n) | 14800 |
| Square | 226472401 |
| Cube | 3408183162649 |
| Square root | 122.674366 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.5049 × |
15049 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and forty-nine |
| Binary (base 2) | 11101011001001 |
| Octal (base 8) | 35311 |
| Hexadecimal (base 16) | 3AC9 |
| Base 3 | 202122101 |
| As time | 15049 seconds = 4 h 10 min 49 s |
Is 15049 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 1) | 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 1) | 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 1) | 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 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15049 a prime number?
No. 15049 = 101 × 149, so it is divisible by 101.
What are the factors of 15049?
1, 101, 149, 15049.
What is 15049 in binary?
11101011001001 (hexadecimal 3AC9, octal 35311).
What is the square root of 15049?
About 122.6744.
Is 15049 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 15049?
15049 is a semiprime: 101 × 149, the product of two primes.