The number 48322
48322 is a composite number with 8 divisors. Its prime factorisation is 2 × 37 × 653. Divisors (8): 1, 2, 37, 74, 653, 1306, 24161, 48322.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48322: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
48322 is composite. Its prime factorisation is
- 3
The divisors add up to 74556; without 48322 itself that is 26234, so 48322 is deficient (26234 is less than 48322). Euler's totient φ(48322) = 23472 numbers up to 48322 share no factor with it.
- 4
The digits of 48322 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 44 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48322 = 2 \times 37 \times 653 \]
48322 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 74556 |
| Euler totient φ(n) | 23472 |
| Square | 2335015684 |
| Cube | 112832627882248 |
| Square root | 219.822656 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 44 |
| Scientific notation | 4.8322 × |
48322 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand three hundred and twenty-two |
| Binary (base 2) | 1011110011000010 |
| Octal (base 8) | 136302 |
| Hexadecimal (base 16) | BCC2 |
| Base 3 | 2110021201 |
| As time | 48322 seconds = 13 h 25 min 22 s |
Is 48322 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48322 ÷ 2 = 24161) | 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 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 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 | No (remainder 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48322 a prime number?
No. 48322 = 2 × 37 × 653, so it is divisible by 2.
What are the factors of 48322?
1, 2, 37, 74, 653, 1306, 24161, 48322.
What is 48322 in binary?
1011110011000010 (hexadecimal BCC2, octal 136302).
What is the square root of 48322?
About 219.8227.
Is 48322 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 48322?
48322 is a happy number: repeatedly adding the squares of its digits reaches 1.