The number 49464
49464 is a composite number with 32 divisors. Its prime factorisation is × × 229. Divisors (32): 1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 27, 36, 54, 72, 108, 216 … 49464.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49464: a Harshad number: divisible by its digit sum 27.
- 2
49464 is composite. Its prime factorisation is
- 3
The divisors add up to 138000; without 49464 itself that is 88536, so 49464 is abundant (88536 is more than 49464). Euler's totient φ(49464) = 16416 numbers up to 49464 share no factor with it.
- 4
The digits of 49464 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49464 = 2^{3} \times 3^{3} \times 229 \]49464 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 138000 |
| Euler totient φ(n) | 16416 |
| Square | 2446687296 |
| Cube | 121022940409344 |
| Square root | 222.405036 (= 6√1374) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9464 × |
49464 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand four hundred and sixty-four |
| Binary (base 2) | 1100000100111000 |
| Octal (base 8) | 140470 |
| Hexadecimal (base 16) | C138 |
| Base 3 | 2111212000 |
| As time | 49464 seconds = 13 h 44 min 24 s |
Is 49464 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49464 ÷ 2 = 24732) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (49464 ÷ 3 = 16488) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (49464 ÷ 4 = 12366) | 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 | Yes (49464 ÷ 6 = 8244) | 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 | Yes (49464 ÷ 8 = 6183) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (49464 ÷ 9 = 5496) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (49464 ÷ 12 = 4122) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49464 a prime number?
No. 49464 = × × 229, so it is divisible by 2.
What are the factors of 49464?
1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 27, 36, 54, 72, 108, 216, 229, 458, 687, 916, 1374, 1832, 2061, 2748, 4122, 5496, 6183, 8244, 12366, 16488, 24732, 49464.
What is 49464 in binary?
1100000100111000 (hexadecimal C138, octal 140470).
What is the square root of 49464?
About 222.4050, exactly 6√1374.
Is 49464 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 49464?
49464 is a Harshad number: divisible by its digit sum 27.