The number 48951
48951 is a composite number with 24 divisors. Its prime factorisation is × × 37. Divisors (24): 1, 3, 7, 9, 21, 27, 37, 49, 63, 111, 147, 189, 259, 333, 441, 777 … 48951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48951: a Harshad number: divisible by its digit sum 27.
- 2
48951 is composite. Its prime factorisation is
- 3
The divisors add up to 86640; without 48951 itself that is 37689, so 48951 is deficient (37689 is less than 48951). Euler's totient φ(48951) = 27216 numbers up to 48951 share no factor with it.
- 4
The digits of 48951 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48951 = 3^{3} \times 7^{2} \times 37 \]48951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 86640 |
| Euler totient φ(n) | 27216 |
| Square | 2396200401 |
| Cube | 117296405829351 |
| Square root | 221.248729 (= 21√111) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.8951 × |
48951 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and fifty-one |
| Binary (base 2) | 1011111100110111 |
| Octal (base 8) | 137467 |
| Hexadecimal (base 16) | BF37 |
| Base 3 | 2111011000 |
| As time | 48951 seconds = 13 h 35 min 51 s |
Is 48951 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 (48951 ÷ 3 = 16317) | 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 (48951 ÷ 7 = 6993) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (48951 ÷ 9 = 5439) | 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 1) | 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 48951 a prime number?
No. 48951 = × × 37, so it is divisible by 3.
What are the factors of 48951?
1, 3, 7, 9, 21, 27, 37, 49, 63, 111, 147, 189, 259, 333, 441, 777, 999, 1323, 1813, 2331, 5439, 6993, 16317, 48951.
What is 48951 in binary?
1011111100110111 (hexadecimal BF37, octal 137467).
What is the square root of 48951?
About 221.2487, exactly 21√111.
Is 48951 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 48951?
48951 is a Harshad number: divisible by its digit sum 27.