The number 48937
48937 is a composite number with 4 divisors. Its prime factorisation is 7 × 6991. Divisors (4): 1, 7, 6991, 48937.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48937: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 7 × 6991, the product of two primes.
- 2
48937 is composite. Its prime factorisation is
- 3
The divisors add up to 55936; without 48937 itself that is 6999, so 48937 is deficient (6999 is less than 48937). Euler's totient φ(48937) = 41940 numbers up to 48937 share no factor with it.
- 4
The digits of 48937 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48937 = 7 \times 6991 \]
48937 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 55936 |
| Euler totient φ(n) | 41940 |
| Square | 2394829969 |
| Cube | 117195794192953 |
| Square root | 221.217088 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.8937 × |
48937 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and thirty-seven |
| Binary (base 2) | 1011111100101001 |
| Octal (base 8) | 137451 |
| Hexadecimal (base 16) | BF29 |
| Base 3 | 2111010111 |
| As time | 48937 seconds = 13 h 35 min 37 s |
Is 48937 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 2) | 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 | Yes (48937 ÷ 7 = 6991) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 48937 a prime number?
No. 48937 = 7 × 6991, so it is divisible by 7.
What are the factors of 48937?
1, 7, 6991, 48937.
What is 48937 in binary?
1011111100101001 (hexadecimal BF29, octal 137451).
What is the square root of 48937?
About 221.2171.
Is 48937 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 48937?
48937 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 7 × 6991, the product of two primes.