The number 49095
49095 is a composite number with 12 divisors. Its prime factorisation is × 5 × 1091. Divisors (12): 1, 3, 5, 9, 15, 45, 1091, 3273, 5455, 9819, 16365, 49095.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49095: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
49095 is composite. Its prime factorisation is
- 3
The divisors add up to 85176; without 49095 itself that is 36081, so 49095 is deficient (36081 is less than 49095). Euler's totient φ(49095) = 26160 numbers up to 49095 share no factor with it.
- 4
The digits of 49095 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
\[ 49095 = 3^{2} \times 5 \times 1091 \]49095 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 85176 |
| Euler totient φ(n) | 26160 |
| Square | 2410319025 |
| Cube | 118334612532375 |
| Square root | 221.573915 (= 3√5455) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9095 × |
49095 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and ninety-five |
| Binary (base 2) | 1011111111000111 |
| Octal (base 8) | 137707 |
| Hexadecimal (base 16) | BFC7 |
| Base 3 | 2111100100 |
| As time | 49095 seconds = 13 h 38 min 15 s |
Is 49095 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 (49095 ÷ 3 = 16365) | 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 | Yes (49095 ÷ 5 = 9819) | 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 4) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (49095 ÷ 9 = 5455) | 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 2) | 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 49095 a prime number?
No. 49095 = × 5 × 1091, so it is divisible by 3.
What are the factors of 49095?
1, 3, 5, 9, 15, 45, 1091, 3273, 5455, 9819, 16365, 49095.
What is 49095 in binary?
1011111111000111 (hexadecimal BFC7, octal 137707).
What is the square root of 49095?
About 221.5739, exactly 3√5455.
Is 49095 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 49095?
49095 is a happy number: repeatedly adding the squares of its digits reaches 1.