The number 49125
49125 is a composite number with 16 divisors. Its prime factorisation is 3 × × 131. Divisors (16): 1, 3, 5, 15, 25, 75, 125, 131, 375, 393, 655, 1965, 3275, 9825, 16375, 49125.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49125 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49125 is composite. Its prime factorisation is
- 3
The divisors add up to 82368; without 49125 itself that is 33243, so 49125 is deficient (33243 is less than 49125). Euler's totient φ(49125) = 26000 numbers up to 49125 share no factor with it.
- 4
The digits of 49125 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49125 = 3 \times 5^{3} \times 131 \]49125 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 82368 |
| Euler totient φ(n) | 26000 |
| Square | 2413265625 |
| Cube | 118551673828125 |
| Square root | 221.641603 (= 5√1965) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 127 |
| Scientific notation | 4.9125 × |
49125 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and twenty-five |
| Binary (base 2) | 1011111111100101 |
| Octal (base 8) | 137745 |
| Hexadecimal (base 16) | BFE5 |
| Base 3 | 2111101110 |
| As time | 49125 seconds = 13 h 38 min 45 s |
Is 49125 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 (49125 ÷ 3 = 16375) | 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 (49125 ÷ 5 = 9825) | 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 6) | 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 5) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49125 a prime number?
No. 49125 = 3 × × 131, so it is divisible by 3.
What are the factors of 49125?
1, 3, 5, 15, 25, 75, 125, 131, 375, 393, 655, 1965, 3275, 9825, 16375, 49125.
What is 49125 in binary?
1011111111100101 (hexadecimal BFE5, octal 137745).
What is the square root of 49125?
About 221.6416, exactly 5√1965.
Is 49125 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 49125?
It is a composite number with 16 divisors.