The number 49002
49002 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 8167. Divisors (8): 1, 2, 3, 6, 8167, 16334, 24501, 49002.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49002 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49002 is composite. Its prime factorisation is
- 3
The divisors add up to 98016; without 49002 itself that is 49014, so 49002 is abundant (49014 is more than 49002). Euler's totient φ(49002) = 16332 numbers up to 49002 share no factor with it.
- 4
The digits of 49002 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49002 = 2 \times 3 \times 8167 \]
49002 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 98016 |
| Euler totient φ(n) | 16332 |
| Square | 2401196004 |
| Cube | 117663406588008 |
| Square root | 221.363954 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.9002 × |
49002 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and two |
| Binary (base 2) | 1011111101101010 |
| Octal (base 8) | 137552 |
| Hexadecimal (base 16) | BF6A |
| Base 3 | 2111012220 |
| As time | 49002 seconds = 13 h 36 min 42 s |
Is 49002 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49002 ÷ 2 = 24501) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49002 ÷ 3 = 16334) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (49002 ÷ 6 = 8167) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 6) | 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 8) | 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 49002 a prime number?
No. 49002 = 2 × 3 × 8167, so it is divisible by 2.
What are the factors of 49002?
1, 2, 3, 6, 8167, 16334, 24501, 49002.
What is 49002 in binary?
1011111101101010 (hexadecimal BF6A, octal 137552).
What is the square root of 49002?
About 221.3640.
Is 49002 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 49002?
It is a composite number with 8 divisors.