The number 49462
49462 is a composite number with 8 divisors. Its prime factorisation is 2 × 7 × 3533. Divisors (8): 1, 2, 7, 14, 3533, 7066, 24731, 49462.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49462 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49462 is composite. Its prime factorisation is
- 3
The divisors add up to 84816; without 49462 itself that is 35354, so 49462 is deficient (35354 is less than 49462). Euler's totient φ(49462) = 21192 numbers up to 49462 share no factor with it.
- 4
The digits of 49462 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49462 = 2 \times 7 \times 3533 \]
49462 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 84816 |
| Euler totient φ(n) | 21192 |
| Square | 2446489444 |
| Cube | 121008260879128 |
| Square root | 222.400540 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9462 × |
49462 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand four hundred and sixty-two |
| Binary (base 2) | 1100000100110110 |
| Octal (base 8) | 140466 |
| Hexadecimal (base 16) | C136 |
| Base 3 | 2111211221 |
| As time | 49462 seconds = 13 h 44 min 22 s |
Is 49462 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49462 ÷ 2 = 24731) | 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 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 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (49462 ÷ 7 = 7066) | 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 7) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49462 a prime number?
No. 49462 = 2 × 7 × 3533, so it is divisible by 2.
What are the factors of 49462?
1, 2, 7, 14, 3533, 7066, 24731, 49462.
What is 49462 in binary?
1100000100110110 (hexadecimal C136, octal 140466).
What is the square root of 49462?
About 222.4005.
Is 49462 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49462?
It is a composite number with 8 divisors.