The number 48312
48312 is a composite number with 48 divisors. Its prime factorisation is × × 11 × 61. Divisors (48): 1, 2, 3, 4, 6, 8, 9, 11, 12, 18, 22, 24, 33, 36, 44, 61 … 48312.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48312: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.
- 2
48312 is composite. Its prime factorisation is
- 3
The divisors add up to 145080; without 48312 itself that is 96768, so 48312 is abundant (96768 is more than 48312). Euler's totient φ(48312) = 14400 numbers up to 48312 share no factor with it.
- 4
The digits of 48312 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48312 = 2^{3} \times 3^{2} \times 11 \times 61 \]48312 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 145080 |
| Euler totient φ(n) | 14400 |
| Square | 2334049344 |
| Cube | 112762591907328 |
| Square root | 219.799909 (= 6√1342) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 70 |
| Scientific notation | 4.8312 × |
48312 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand three hundred and twelve |
| Binary (base 2) | 1011110010111000 |
| Octal (base 8) | 136270 |
| Hexadecimal (base 16) | BCB8 |
| Base 3 | 2110021100 |
| As time | 48312 seconds = 13 h 25 min 12 s |
Is 48312 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48312 ÷ 2 = 24156) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (48312 ÷ 3 = 16104) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (48312 ÷ 4 = 12078) | 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 | Yes (48312 ÷ 6 = 8052) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 (48312 ÷ 8 = 6039) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (48312 ÷ 9 = 5368) | 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 | Yes (48312 ÷ 11 = 4392) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (48312 ÷ 12 = 4026) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48312 a prime number?
No. 48312 = × × 11 × 61, so it is divisible by 2.
What are the factors of 48312?
1, 2, 3, 4, 6, 8, 9, 11, 12, 18, 22, 24, 33, 36, 44, 61, 66, 72, 88, 99, 122, 132, 183, 198, 244, 264, 366, 396, 488, 549, 671, 732, 792, 1098, 1342, 1464, 2013, 2196, 2684, 4026, 4392, 5368, 6039, 8052, 12078, 16104, 24156, 48312.
What is 48312 in binary?
1011110010111000 (hexadecimal BCB8, octal 136270).
What is the square root of 48312?
About 219.7999, exactly 6√1342.
Is 48312 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 48312?
48312 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.