The number 5905
5905 is a composite number with 4 divisors. Its prime factorisation is 5 × 1181. Divisors (4): 1, 5, 1181, 5905.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5905: a semiprime: 5 × 1181, the product of two primes.
- 2
5905 is composite. Its prime factorisation is
- 3
The divisors add up to 7092; without 5905 itself that is 1187, so 5905 is deficient (1187 is less than 5905). Euler's totient φ(5905) = 4720 numbers up to 5905 share no factor with it.
- 4
The digits of 5905 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 142 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5905 = 5 \times 1181 \]
5905 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 7092 |
| Euler totient φ(n) | 4720 |
| Square | 34869025 |
| Cube | 205901592625 |
| Square root | 76.843998 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 142 |
| Scientific notation | 5.905 × |
5905 in other forms
| Form | Value |
|---|---|
| In words | five thousand nine hundred and five |
| Binary (base 2) | 1011100010001 |
| Octal (base 8) | 13421 |
| Hexadecimal (base 16) | 1711 |
| Base 3 | 22002201 |
| As time | 5905 seconds = 1 h 38 min 25 s |
Is 5905 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 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (5905 ÷ 5 = 1181) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 1) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5905 a prime number?
No. 5905 = 5 × 1181, so it is divisible by 5.
What are the factors of 5905?
1, 5, 1181, 5905.
What is 5905 in binary?
1011100010001 (hexadecimal 1711, octal 13421).
What is the square root of 5905?
About 76.8440.
Is 5905 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 5905?
5905 is a semiprime: 5 × 1181, the product of two primes.