The number 48059
48059 is a composite number with 8 divisors. Its prime factorisation is 11 × 17 × 257. Divisors (8): 1, 11, 17, 187, 257, 2827, 4369, 48059.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48059 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48059 is composite. Its prime factorisation is
- 3
The divisors add up to 55728; without 48059 itself that is 7669, so 48059 is deficient (7669 is less than 48059). Euler's totient φ(48059) = 40960 numbers up to 48059 share no factor with it.
- 4
The digits of 48059 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 44 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48059 = 11 \times 17 \times 257 \]
48059 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 55728 |
| Euler totient φ(n) | 40960 |
| Square | 2309667481 |
| Cube | 111000309469379 |
| Square root | 219.223630 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 44 |
| Scientific notation | 4.8059 × |
48059 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand and fifty-nine |
| Binary (base 2) | 1011101110111011 |
| Octal (base 8) | 135673 |
| Hexadecimal (base 16) | BBBB |
| Base 3 | 2102220222 |
| As time | 48059 seconds = 13 h 20 min 59 s |
Is 48059 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 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 5) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 | Yes (48059 ÷ 11 = 4369) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48059 a prime number?
No. 48059 = 11 × 17 × 257, so it is divisible by 11.
What are the factors of 48059?
1, 11, 17, 187, 257, 2827, 4369, 48059.
What is 48059 in binary?
1011101110111011 (hexadecimal BBBB, octal 135673).
What is the square root of 48059?
About 219.2236.
Is 48059 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 48059?
It is a composite number with 8 divisors.