The number 48929
48929 is a composite number with 4 divisors. Its prime factorisation is 113 × 433. Divisors (4): 1, 113, 433, 48929.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48929: a semiprime: 113 × 433, the product of two primes.
- 2
48929 is composite. Its prime factorisation is
- 3
The divisors add up to 49476; without 48929 itself that is 547, so 48929 is deficient (547 is less than 48929). Euler's totient φ(48929) = 48384 numbers up to 48929 share no factor with it.
- 4
The digits of 48929 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48929 = 113 \times 433 \]
48929 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 49476 |
| Euler totient φ(n) | 48384 |
| Square | 2394047041 |
| Cube | 117138327669089 |
| Square root | 221.199005 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.8929 × |
48929 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and twenty-nine |
| Binary (base 2) | 1011111100100001 |
| Octal (base 8) | 137441 |
| Hexadecimal (base 16) | BF21 |
| Base 3 | 2111010012 |
| As time | 48929 seconds = 13 h 35 min 29 s |
Is 48929 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 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 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 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 48929 a prime number?
No. 48929 = 113 × 433, so it is divisible by 113.
What are the factors of 48929?
1, 113, 433, 48929.
What is 48929 in binary?
1011111100100001 (hexadecimal BF21, octal 137441).
What is the square root of 48929?
About 221.1990.
Is 48929 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 48929?
48929 is a semiprime: 113 × 433, the product of two primes.