The number 48061
48061 is a composite number with 4 divisors. Its prime factorisation is 13 × 3697. Divisors (4): 1, 13, 3697, 48061.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48061: a semiprime: 13 × 3697, the product of two primes.
- 2
48061 is composite. Its prime factorisation is
- 3
The divisors add up to 51772; without 48061 itself that is 3711, so 48061 is deficient (3711 is less than 48061). Euler's totient φ(48061) = 44352 numbers up to 48061 share no factor with it.
- 4
The digits of 48061 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48061 = 13 \times 3697 \]
48061 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 51772 |
| Euler totient φ(n) | 44352 |
| Square | 2309859721 |
| Cube | 111014168050981 |
| Square root | 219.228192 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.8061 × |
48061 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand and sixty-one |
| Binary (base 2) | 1011101110111101 |
| Octal (base 8) | 135675 |
| Hexadecimal (base 16) | BBBD |
| Base 3 | 2102221001 |
| As time | 48061 seconds = 13 h 21 min 1 s |
Is 48061 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 1) | 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 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48061 a prime number?
No. 48061 = 13 × 3697, so it is divisible by 13.
What are the factors of 48061?
1, 13, 3697, 48061.
What is 48061 in binary?
1011101110111101 (hexadecimal BBBD, octal 135675).
What is the square root of 48061?
About 219.2282.
Is 48061 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 48061?
48061 is a semiprime: 13 × 3697, the product of two primes.