The number 49059
49059 is a composite number with 16 divisors. Its prime factorisation is × 23 × 79. Divisors (16): 1, 3, 9, 23, 27, 69, 79, 207, 237, 621, 711, 1817, 2133, 5451, 16353, 49059.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49059: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 27.
- 2
49059 is composite. Its prime factorisation is
- 3
The divisors add up to 76800; without 49059 itself that is 27741, so 49059 is deficient (27741 is less than 49059). Euler's totient φ(49059) = 30888 numbers up to 49059 share no factor with it.
- 4
The digits of 49059 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
\[ 49059 = 3^{3} \times 23 \times 79 \]49059 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 76800 |
| Euler totient φ(n) | 30888 |
| Square | 2406785481 |
| Cube | 118074488912379 |
| Square root | 221.492664 (= 3√5451) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9059 × |
49059 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and fifty-nine |
| Binary (base 2) | 1011111110100011 |
| Octal (base 8) | 137643 |
| Hexadecimal (base 16) | BFA3 |
| Base 3 | 2111022000 |
| As time | 49059 seconds = 13 h 37 min 39 s |
Is 49059 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 (49059 ÷ 3 = 16353) | 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 | No (remainder 4) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (49059 ÷ 9 = 5451) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49059 a prime number?
No. 49059 = × 23 × 79, so it is divisible by 3.
What are the factors of 49059?
1, 3, 9, 23, 27, 69, 79, 207, 237, 621, 711, 1817, 2133, 5451, 16353, 49059.
What is 49059 in binary?
1011111110100011 (hexadecimal BFA3, octal 137643).
What is the square root of 49059?
About 221.4927, exactly 3√5451.
Is 49059 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 49059?
49059 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 27.