The number 48641
48641 is a composite number with 4 divisors. Its prime factorisation is 127 × 383. Divisors (4): 1, 127, 383, 48641.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48641: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 127 × 383, the product of two primes.
- 2
48641 is composite. Its prime factorisation is
- 3
The divisors add up to 49152; without 48641 itself that is 511, so 48641 is deficient (511 is less than 48641). Euler's totient φ(48641) = 48132 numbers up to 48641 share no factor with it.
- 4
The digits of 48641 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48641 = 127 \times 383 \]
48641 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 49152 |
| Euler totient φ(n) | 48132 |
| Square | 2365946881 |
| Cube | 115082022238721 |
| Square root | 220.547047 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.8641 × |
48641 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand six hundred and forty-one |
| Binary (base 2) | 1011111000000001 |
| Octal (base 8) | 137001 |
| Hexadecimal (base 16) | BE01 |
| Base 3 | 2110201112 |
| As time | 48641 seconds = 13 h 30 min 41 s |
Is 48641 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 | No (remainder 5) | 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 5) | 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 10) | 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 48641 a prime number?
No. 48641 = 127 × 383, so it is divisible by 127.
What are the factors of 48641?
1, 127, 383, 48641.
What is 48641 in binary?
1011111000000001 (hexadecimal BE01, octal 137001).
What is the square root of 48641?
About 220.5470.
Is 48641 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 48641?
48641 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 127 × 383, the product of two primes.