The number 49467
49467 is a composite number with 8 divisors. Its prime factorisation is 3 × 11 × 1499. Divisors (8): 1, 3, 11, 33, 1499, 4497, 16489, 49467.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49467 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49467 is composite. Its prime factorisation is
- 3
The divisors add up to 72000; without 49467 itself that is 22533, so 49467 is deficient (22533 is less than 49467). Euler's totient φ(49467) = 29960 numbers up to 49467 share no factor with it.
- 4
The digits of 49467 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49467 = 3 \times 11 \times 1499 \]
49467 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 72000 |
| Euler totient φ(n) | 29960 |
| Square | 2446984089 |
| Cube | 121044961930563 |
| Square root | 222.411780 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9467 × |
49467 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand four hundred and sixty-seven |
| Binary (base 2) | 1100000100111011 |
| Octal (base 8) | 140473 |
| Hexadecimal (base 16) | C13B |
| Base 3 | 2111212010 |
| As time | 49467 seconds = 13 h 44 min 27 s |
Is 49467 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 | Yes (49467 ÷ 3 = 16489) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 3) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (49467 ÷ 11 = 4497) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49467 a prime number?
No. 49467 = 3 × 11 × 1499, so it is divisible by 3.
What are the factors of 49467?
1, 3, 11, 33, 1499, 4497, 16489, 49467.
What is 49467 in binary?
1100000100111011 (hexadecimal C13B, octal 140473).
What is the square root of 49467?
About 222.4118.
Is 49467 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 49467?
It is a composite number with 8 divisors.