The number 48063
48063 is a composite number with 8 divisors. Its prime factorisation is 3 × 37 × 433. Divisors (8): 1, 3, 37, 111, 433, 1299, 16021, 48063.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48063 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48063 is composite. Its prime factorisation is
- 3
The divisors add up to 65968; without 48063 itself that is 17905, so 48063 is deficient (17905 is less than 48063). Euler's totient φ(48063) = 31104 numbers up to 48063 share no factor with it.
- 4
The digits of 48063 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 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48063 = 3 \times 37 \times 433 \]
48063 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 65968 |
| Euler totient φ(n) | 31104 |
| Square | 2310051969 |
| Cube | 111028027786047 |
| Square root | 219.232753 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.8063 × |
48063 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand and sixty-three |
| Binary (base 2) | 1011101110111111 |
| Octal (base 8) | 135677 |
| Hexadecimal (base 16) | BBBF |
| Base 3 | 2102221010 |
| As time | 48063 seconds = 13 h 21 min 3 s |
Is 48063 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 (48063 ÷ 3 = 16021) | 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 3) | 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 | 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 | No (remainder 7) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 48063 a prime number?
No. 48063 = 3 × 37 × 433, so it is divisible by 3.
What are the factors of 48063?
1, 3, 37, 111, 433, 1299, 16021, 48063.
What is 48063 in binary?
1011101110111111 (hexadecimal BBBF, octal 135677).
What is the square root of 48063?
About 219.2328.
Is 48063 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 48063?
It is a composite number with 8 divisors.