The number 49465
49465 is a composite number with 8 divisors. Its prime factorisation is 5 × 13 × 761. Divisors (8): 1, 5, 13, 65, 761, 3805, 9893, 49465.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49465 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49465 is composite. Its prime factorisation is
- 3
The divisors add up to 64008; without 49465 itself that is 14543, so 49465 is deficient (14543 is less than 49465). Euler's totient φ(49465) = 36480 numbers up to 49465 share no factor with it.
- 4
The digits of 49465 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49465 = 5 \times 13 \times 761 \]
49465 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 64008 |
| Euler totient φ(n) | 36480 |
| Square | 2446786225 |
| Cube | 121030280619625 |
| Square root | 222.407284 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9465 × |
49465 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand four hundred and sixty-five |
| Binary (base 2) | 1100000100111001 |
| Octal (base 8) | 140471 |
| Hexadecimal (base 16) | C139 |
| Base 3 | 2111212001 |
| As time | 49465 seconds = 13 h 44 min 25 s |
Is 49465 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 | Yes (49465 ÷ 5 = 9893) | 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 3) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 49465 a prime number?
No. 49465 = 5 × 13 × 761, so it is divisible by 5.
What are the factors of 49465?
1, 5, 13, 65, 761, 3805, 9893, 49465.
What is 49465 in binary?
1100000100111001 (hexadecimal C139, octal 140471).
What is the square root of 49465?
About 222.4073.
Is 49465 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 49465?
It is a composite number with 8 divisors.