The number 48041
48041 is a composite number with 4 divisors. Its prime factorisation is 7 × 6863. Divisors (4): 1, 7, 6863, 48041.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48041: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 7 × 6863, the product of two primes.
- 2
48041 is composite. Its prime factorisation is
- 3
The divisors add up to 54912; without 48041 itself that is 6871, so 48041 is deficient (6871 is less than 48041). Euler's totient φ(48041) = 41172 numbers up to 48041 share no factor with it.
- 4
The digits of 48041 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 251 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48041 = 7 \times 6863 \]
48041 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 54912 |
| Euler totient φ(n) | 41172 |
| Square | 2307937681 |
| Cube | 110875634132921 |
| Square root | 219.182572 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 251 |
| Scientific notation | 4.8041 × |
48041 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand and forty-one |
| Binary (base 2) | 1011101110101001 |
| Octal (base 8) | 135651 |
| Hexadecimal (base 16) | BBA9 |
| Base 3 | 2102220022 |
| As time | 48041 seconds = 13 h 20 min 41 s |
Is 48041 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 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (48041 ÷ 7 = 6863) | 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 1) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48041 a prime number?
No. 48041 = 7 × 6863, so it is divisible by 7.
What are the factors of 48041?
1, 7, 6863, 48041.
What is 48041 in binary?
1011101110101001 (hexadecimal BBA9, octal 135651).
What is the square root of 48041?
About 219.1826.
Is 48041 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 48041?
48041 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 7 × 6863, the product of two primes.