The number 5305
5305 is a composite number with 4 divisors. Its prime factorisation is 5 × 1061. Divisors (4): 1, 5, 1061, 5305.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5305: a semiprime: 5 × 1061, the product of two primes.
- 2
5305 is composite. Its prime factorisation is
- 3
The divisors add up to 6372; without 5305 itself that is 1067, so 5305 is deficient (1067 is less than 5305). Euler's totient φ(5305) = 4240 numbers up to 5305 share no factor with it.
- 4
The digits of 5305 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 98 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5305 = 5 \times 1061 \]
5305 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 6372 |
| Euler totient φ(n) | 4240 |
| Square | 28143025 |
| Cube | 149298747625 |
| Square root | 72.835431 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 98 |
| Scientific notation | 5.305 × |
5305 in other forms
| Form | Value |
|---|---|
| In words | five thousand three hundred and five |
| Binary (base 2) | 1010010111001 |
| Octal (base 8) | 12271 |
| Hexadecimal (base 16) | 14B9 |
| Base 3 | 21021111 |
| As time | 5305 seconds = 1 h 28 min 25 s |
Is 5305 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 (5305 ÷ 5 = 1061) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 3) | 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 5305 a prime number?
No. 5305 = 5 × 1061, so it is divisible by 5.
What are the factors of 5305?
1, 5, 1061, 5305.
What is 5305 in binary?
1010010111001 (hexadecimal 14B9, octal 12271).
What is the square root of 5305?
About 72.8354.
Is 5305 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 5305?
5305 is a semiprime: 5 × 1061, the product of two primes.