The number 48513
48513 is a composite number with 8 divisors. Its prime factorisation is 3 × 103 × 157. Divisors (8): 1, 3, 103, 157, 309, 471, 16171, 48513.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48513 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48513 is composite. Its prime factorisation is
- 3
The divisors add up to 65728; without 48513 itself that is 17215, so 48513 is deficient (17215 is less than 48513). Euler's totient φ(48513) = 31824 numbers up to 48513 share no factor with it.
- 4
The digits of 48513 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48513 = 3 \times 103 \times 157 \]
48513 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 65728 |
| Euler totient φ(n) | 31824 |
| Square | 2353511169 |
| Cube | 114175887341697 |
| Square root | 220.256668 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.8513 × |
48513 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and thirteen |
| Binary (base 2) | 1011110110000001 |
| Octal (base 8) | 136601 |
| Hexadecimal (base 16) | BD81 |
| Base 3 | 2110112210 |
| As time | 48513 seconds = 13 h 28 min 33 s |
Is 48513 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 | Yes (48513 ÷ 3 = 16171) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48513 a prime number?
No. 48513 = 3 × 103 × 157, so it is divisible by 3.
What are the factors of 48513?
1, 3, 103, 157, 309, 471, 16171, 48513.
What is 48513 in binary?
1011110110000001 (hexadecimal BD81, octal 136601).
What is the square root of 48513?
About 220.2567.
Is 48513 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 48513?
It is a composite number with 8 divisors.