The number 49145
49145 is a composite number with 4 divisors. Its prime factorisation is 5 × 9829. Divisors (4): 1, 5, 9829, 49145.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49145: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 9829, the product of two primes.
- 2
49145 is composite. Its prime factorisation is
- 3
The divisors add up to 58980; without 49145 itself that is 9835, so 49145 is deficient (9835 is less than 49145). Euler's totient φ(49145) = 39312 numbers up to 49145 share no factor with it.
- 4
The digits of 49145 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49145 = 5 \times 9829 \]
49145 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 58980 |
| Euler totient φ(n) | 39312 |
| Square | 2415231025 |
| Cube | 118696528723625 |
| Square root | 221.686716 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9145 × |
49145 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and forty-five |
| Binary (base 2) | 1011111111111001 |
| Octal (base 8) | 137771 |
| Hexadecimal (base 16) | BFF9 |
| Base 3 | 2111102012 |
| As time | 49145 seconds = 13 h 39 min 5 s |
Is 49145 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 2) | 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 (49145 ÷ 5 = 9829) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49145 a prime number?
No. 49145 = 5 × 9829, so it is divisible by 5.
What are the factors of 49145?
1, 5, 9829, 49145.
What is 49145 in binary?
1011111111111001 (hexadecimal BFF9, octal 137771).
What is the square root of 49145?
About 221.6867.
Is 49145 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 49145?
49145 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 9829, the product of two primes.