The number 5922
5922 is a composite number with 24 divisors. Its prime factorisation is 2 × × 7 × 47. Divisors (24): 1, 2, 3, 6, 7, 9, 14, 18, 21, 42, 47, 63, 94, 126, 141, 282 … 5922.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5922: a Harshad number: divisible by its digit sum 18.
- 2
5922 is composite. Its prime factorisation is
- 3
The divisors add up to 14976; without 5922 itself that is 9054, so 5922 is abundant (9054 is more than 5922). Euler's totient φ(5922) = 1656 numbers up to 5922 share no factor with it.
- 4
The digits of 5922 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 36 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5922 = 2 \times 3^{2} \times 7 \times 47 \]5922 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 14976 |
| Euler totient φ(n) | 1656 |
| Square | 35070084 |
| Cube | 207685037448 |
| Square root | 76.954532 (= 3√658) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 36 |
| Scientific notation | 5.922 × |
5922 in other forms
| Form | Value |
|---|---|
| In words | five thousand nine hundred and twenty-two |
| Binary (base 2) | 1011100100010 |
| Octal (base 8) | 13442 |
| Hexadecimal (base 16) | 1722 |
| Base 3 | 22010100 |
| As time | 5922 seconds = 1 h 38 min 42 s |
Is 5922 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5922 ÷ 2 = 2961) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (5922 ÷ 3 = 1974) | 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 | Yes (5922 ÷ 6 = 987) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (5922 ÷ 7 = 846) | 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 | Yes (5922 ÷ 9 = 658) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5922 a prime number?
No. 5922 = 2 × × 7 × 47, so it is divisible by 2.
What are the factors of 5922?
1, 2, 3, 6, 7, 9, 14, 18, 21, 42, 47, 63, 94, 126, 141, 282, 329, 423, 658, 846, 987, 1974, 2961, 5922.
What is 5922 in binary?
1011100100010 (hexadecimal 1722, octal 13442).
What is the square root of 5922?
About 76.9545, exactly 3√658.
Is 5922 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 5922?
5922 is a Harshad number: divisible by its digit sum 18.