The number 5906
5906 is a composite number with 4 divisors. Its prime factorisation is 2 × 2953. Divisors (4): 1, 2, 2953, 5906.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5906: a semiprime: 2 × 2953, the product of two primes.
- 2
5906 is composite. Its prime factorisation is
- 3
The divisors add up to 8862; without 5906 itself that is 2956, so 5906 is deficient (2956 is less than 5906). Euler's totient φ(5906) = 2952 numbers up to 5906 share no factor with it.
- 4
The digits of 5906 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 124 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5906 = 2 \times 2953 \]
5906 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 8862 |
| Euler totient φ(n) | 2952 |
| Square | 34880836 |
| Cube | 206006217416 |
| Square root | 76.850504 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 124 |
| Scientific notation | 5.906 × |
5906 in other forms
| Form | Value |
|---|---|
| In words | five thousand nine hundred and six |
| Binary (base 2) | 1011100010010 |
| Octal (base 8) | 13422 |
| Hexadecimal (base 16) | 1712 |
| Base 3 | 22002202 |
| As time | 5906 seconds = 1 h 38 min 26 s |
Is 5906 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5906 ÷ 2 = 2953) | 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 1) | 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 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 | No (remainder 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5906 a prime number?
No. 5906 = 2 × 2953, so it is divisible by 2.
What are the factors of 5906?
1, 2, 2953, 5906.
What is 5906 in binary?
1011100010010 (hexadecimal 1712, octal 13422).
What is the square root of 5906?
About 76.8505.
Is 5906 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 5906?
5906 is a semiprime: 2 × 2953, the product of two primes.