The number 48112
48112 is a composite number with 20 divisors. Its prime factorisation is × 31 × 97. Divisors (20): 1, 2, 4, 8, 16, 31, 62, 97, 124, 194, 248, 388, 496, 776, 1552, 3007 … 48112.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48112: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 16.
- 2
48112 is composite. Its prime factorisation is
- 3
The divisors add up to 97216; without 48112 itself that is 49104, so 48112 is abundant (49104 is more than 48112). Euler's totient φ(48112) = 23040 numbers up to 48112 share no factor with it.
- 4
The digits of 48112 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48112 = 2^{4} \times 31 \times 97 \]48112 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 97216 |
| Euler totient φ(n) | 23040 |
| Square | 2314764544 |
| Cube | 111367951740928 |
| Square root | 219.344478 (= 4√3007) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.8112 × |
48112 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand one hundred and twelve |
| Binary (base 2) | 1011101111110000 |
| Octal (base 8) | 135760 |
| Hexadecimal (base 16) | BBF0 |
| Base 3 | 2102222221 |
| As time | 48112 seconds = 13 h 21 min 52 s |
Is 48112 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48112 ÷ 2 = 24056) | 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 | Yes (48112 ÷ 4 = 12028) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 | Yes (48112 ÷ 8 = 6014) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48112 a prime number?
No. 48112 = × 31 × 97, so it is divisible by 2.
What are the factors of 48112?
1, 2, 4, 8, 16, 31, 62, 97, 124, 194, 248, 388, 496, 776, 1552, 3007, 6014, 12028, 24056, 48112.
What is 48112 in binary?
1011101111110000 (hexadecimal BBF0, octal 135760).
What is the square root of 48112?
About 219.3445, exactly 4√3007.
Is 48112 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 48112?
48112 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 16.