The number 48531
48531 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 2311. Divisors (8): 1, 3, 7, 21, 2311, 6933, 16177, 48531.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48531: a Harshad number: divisible by its digit sum 21.
- 2
48531 is composite. Its prime factorisation is
- 3
The divisors add up to 73984; without 48531 itself that is 25453, so 48531 is deficient (25453 is less than 48531). Euler's totient φ(48531) = 27720 numbers up to 48531 share no factor with it.
- 4
The digits of 48531 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 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48531 = 3 \times 7 \times 2311 \]
48531 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 73984 |
| Euler totient φ(n) | 27720 |
| Square | 2355257961 |
| Cube | 114303024105291 |
| Square root | 220.297526 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 127 |
| Scientific notation | 4.8531 × |
48531 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and thirty-one |
| Binary (base 2) | 1011110110010011 |
| Octal (base 8) | 136623 |
| Hexadecimal (base 16) | BD93 |
| Base 3 | 2110120110 |
| As time | 48531 seconds = 13 h 28 min 51 s |
Is 48531 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 (48531 ÷ 3 = 16177) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (48531 ÷ 7 = 6933) | 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 3) | 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 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48531 a prime number?
No. 48531 = 3 × 7 × 2311, so it is divisible by 3.
What are the factors of 48531?
1, 3, 7, 21, 2311, 6933, 16177, 48531.
What is 48531 in binary?
1011110110010011 (hexadecimal BD93, octal 136623).
What is the square root of 48531?
About 220.2975.
Is 48531 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 48531?
48531 is a Harshad number: divisible by its digit sum 21.