The number 48946
48946 is a composite number with 4 divisors. Its prime factorisation is 2 × 24473. Divisors (4): 1, 2, 24473, 48946.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48946: a semiprime: 2 × 24473, the product of two primes.
- 2
48946 is composite. Its prime factorisation is
- 3
The divisors add up to 73422; without 48946 itself that is 24476, so 48946 is deficient (24476 is less than 48946). Euler's totient φ(48946) = 24472 numbers up to 48946 share no factor with it.
- 4
The digits of 48946 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48946 = 2 \times 24473 \]
48946 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 73422 |
| Euler totient φ(n) | 24472 |
| Square | 2395710916 |
| Cube | 117260466494536 |
| Square root | 221.237429 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 114 |
| Scientific notation | 4.8946 × |
48946 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and forty-six |
| Binary (base 2) | 1011111100110010 |
| Octal (base 8) | 137462 |
| Hexadecimal (base 16) | BF32 |
| Base 3 | 2111010211 |
| As time | 48946 seconds = 13 h 35 min 46 s |
Is 48946 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48946 ÷ 2 = 24473) | 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 2) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48946 a prime number?
No. 48946 = 2 × 24473, so it is divisible by 2.
What are the factors of 48946?
1, 2, 24473, 48946.
What is 48946 in binary?
1011111100110010 (hexadecimal BF32, octal 137462).
What is the square root of 48946?
About 221.2374.
Is 48946 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 48946?
48946 is a semiprime: 2 × 24473, the product of two primes.