The number 48529
48529 is a composite number with 4 divisors. Its prime factorisation is 13 × 3733. Divisors (4): 1, 13, 3733, 48529.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48529: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 3733, the product of two primes.
- 2
48529 is composite. Its prime factorisation is
- 3
The divisors add up to 52276; without 48529 itself that is 3747, so 48529 is deficient (3747 is less than 48529). Euler's totient φ(48529) = 44784 numbers up to 48529 share no factor with it.
- 4
The digits of 48529 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48529 = 13 \times 3733 \]
48529 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 52276 |
| Euler totient φ(n) | 44784 |
| Square | 2355063841 |
| Cube | 114288893139889 |
| Square root | 220.292987 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 127 |
| Scientific notation | 4.8529 × |
48529 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and twenty-nine |
| Binary (base 2) | 1011110110010001 |
| Octal (base 8) | 136621 |
| Hexadecimal (base 16) | BD91 |
| Base 3 | 2110120101 |
| As time | 48529 seconds = 13 h 28 min 49 s |
Is 48529 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 4) | 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 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 1) | 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 8) | 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 48529 a prime number?
No. 48529 = 13 × 3733, so it is divisible by 13.
What are the factors of 48529?
1, 13, 3733, 48529.
What is 48529 in binary?
1011110110010001 (hexadecimal BD91, octal 136621).
What is the square root of 48529?
About 220.2930.
Is 48529 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 48529?
48529 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 3733, the product of two primes.