The number 48362
48362 is a composite number with 4 divisors. Its prime factorisation is 2 × 24181. Divisors (4): 1, 2, 24181, 48362.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48362: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 24181, the product of two primes.
- 2
48362 is composite. Its prime factorisation is
- 3
The divisors add up to 72546; without 48362 itself that is 24184, so 48362 is deficient (24184 is less than 48362). Euler's totient φ(48362) = 24180 numbers up to 48362 share no factor with it.
- 4
The digits of 48362 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48362 = 2 \times 24181 \]
48362 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 72546 |
| Euler totient φ(n) | 24180 |
| Square | 2338883044 |
| Cube | 113113061773928 |
| Square root | 219.913619 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.8362 × |
48362 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand three hundred and sixty-two |
| Binary (base 2) | 1011110011101010 |
| Octal (base 8) | 136352 |
| Hexadecimal (base 16) | BCEA |
| Base 3 | 2110100012 |
| As time | 48362 seconds = 13 h 26 min 2 s |
Is 48362 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48362 ÷ 2 = 24181) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48362 a prime number?
No. 48362 = 2 × 24181, so it is divisible by 2.
What are the factors of 48362?
1, 2, 24181, 48362.
What is 48362 in binary?
1011110011101010 (hexadecimal BCEA, octal 136352).
What is the square root of 48362?
About 219.9136.
Is 48362 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 48362?
48362 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 24181, the product of two primes.